×

Homomorphism equivalence on ETOL languages. (English) Zbl 0401.68049


MSC:

68Q45 Formal languages and automata
03D60 Computability and recursion theory on ordinals, admissible sets, etc.
03B25 Decidability of theories and sets of sentences
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Aho A.V., JACM 15 pp 647– (1968) · Zbl 0175.27801
[2] Culik K., Theoretical Computer Science 3 pp 75– (1977) · Zbl 0352.68103
[3] Culik K., Acta Informatica 10 pp 79– (1978) · Zbl 0385.68060
[4] Culik K., JACM
[5] Culik II K., Some decidability results about regular and push down translations Inform.Processing Letters
[6] Culik K., Information and Control 35 pp 20– (1977) · Zbl 0365.68074
[7] Culik K., J. Comput. System Sci
[8] Ehrenfeucht A., Theoretical Computer Science
[9] Ehrenfeucht A., Acta Informatica 3 pp 265– (1974) · Zbl 0313.68062
[10] Rosenkrantz D.J., JACM 16 pp 107– (1969) · Zbl 0182.02004
[11] Salomaa A., Formal Languages (1973)
[12] Salomaa A., Acta Cybernetica
[13] Salomaa A., Automata Theoretic Aspects of Formal Power Series (1978) · Zbl 0377.68039
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.