Honkala, Juha It is decidable whether or not a permutation-free morphism is an L code. (English) Zbl 0684.68091 Int. J. Comput. Math. 22, No. 1, 1-11 (1987). The author’s abstract: “We show that it is decidable whether or not a permutation-free morphism is an L code. We also show that the degree of L-ambiguity with respect to a set of words can be computed effectively.” Reviewer: W.Buszkowski Cited in 3 Documents MSC: 68Q45 Formal languages and automata Keywords:morphism in languages; decidability ambiguity; L code PDFBibTeX XMLCite \textit{J. Honkala}, Int. J. Comput. Math. 22, No. 1, 1--11 (1987; Zbl 0684.68091) Full Text: DOI References: [1] Berstel J., Theory of Codes (1985) · Zbl 0587.68066 [2] DOI: 10.1016/S0019-9958(83)80001-1 · Zbl 0541.03006 [3] DOI: 10.1016/S0019-9958(78)90095-5 · Zbl 0387.68062 [4] DOI: 10.1016/0166-218X(82)90044-0 · Zbl 0537.94024 [5] DOI: 10.1016/0304-3975(84)90126-9 · Zbl 0546.68066 [6] Klöve T. L codes on alphabets with two symbols Report in Informatics Dept. of Math., Univ. of Bergen 1983 [7] DOI: 10.1016/0304-3975(83)90111-1 · Zbl 0531.68027 [8] Rozenberg G., The Mathematical Theory of L Systems (1980) · Zbl 0508.68031 [9] Salomaa A., Jewels of Formal Language Theory (1981) · Zbl 0487.68063 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.