A homomorphic characterization of principal semi AFLs without using intersection with regular sets. (English) Zbl 0506.68063


68Q45 Formal languages and automata
Full Text: DOI


[1] Culik, K.; Fich, F. E.; Salomaa, A., A homomorphic characterization of regular languages, Discrete Appl. Math., 4, 149-152 (1982) · Zbl 0481.68069
[2] Ginsburg, S., Algebraic and Automata-Theoretic Properties of Formal Languages (1975), North-Holland · Zbl 0325.68002
[3] Greibach, S.; Hopcroft, J., Independence of AFL operations, (Studies in Abstract Families of Languages. Studies in Abstract Families of Languages, Memoirs of the American Mathematical Society, No. 87 (1969)), 33-40 · Zbl 0194.31402
[4] Salomaa, A., Theory of Automata (1969), Pergamon · Zbl 0193.32901
[5] Salomaa, A., Jewels of Formal Language Theory (1981), Computer Science Press · 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.