Some decidability results about regular and pushdown translations. (English) Zbl 0397.68083


68Q45 Formal languages and automata
03B25 Decidability of theories and sets of sentences
Full Text: DOI


[1] Aho, A.V.; Ullman, J.D., The theory of parsing, translation, and compiling, vol. I: parsing, (1972), Prentice-Hall · Zbl 0264.68032
[2] Culik, K.; Fris, I., The decidability of the equivalence problem for DOL-systems, Information and control, 35, 20-39, (1977) · Zbl 0365.68074
[3] K. Culik and A. Salomaa, On the decidability of homomorphism equivalence for languages, J. Comput. System Sci., to appear. · Zbl 0389.68042
[4] Hopcroft, J.E.; Ullman, J.D., Formal languages and their relations to automata, (1969), Addison-Wesley · Zbl 0196.01701
[5] Salomaa, A.; Soittola, M., Automata-theoretic aspects of formal power series, (1978), Springer-Verlag · 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.