论文信息 - On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages

On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages

It is shown that the equivalence problem of H−1H on the family of context-free languages is decidable, where H is the family of morphisms and H−1 is the family of inverse morphisms.

[1] Arto Salomaa,et al. On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..

[2] Karel Culik. Some Decidability Results About Regular and Pushdown Translations , 1979, Inf. Process. Lett..

[3] Derick Wood,et al. Inverse Morphic Equivalence on Languages , 1984, Inf. Process. Lett..

[4] Juhani Karhumäki,et al. On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages , 1985, RAIRO Theor. Informatics Appl..

[5] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[6] Juhani Karhumäki,et al. The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids , 1984, Theor. Comput. Sci..

[7] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

[8] Amiram Yehudai,et al. Balance of Many-Valued Transductions and Equivalence Problems , 1986, Theor. Comput. Sci..