论文信息 - On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages

On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages

Les principaux resultats sont les deux theoremes suivants sur la composition de morphismes et de morphismes inverses. Il est indecidable si deux transductions de la forme h 2 h 1 −1 , ou h 1 et h 2 sont des morphismes, sont equivalents (mot a mot) sur un langage rationnel donne, alors que le meme probleme est decidable pour les transductions de la forme h 1 −1 h 2 . Par consequent, ceci constitue une ligne de demarquation precise entre des problemes decidables et indecidables

Juhani Karhumäki | Jetty Kleijn

[1] Juhani Karhumäki,et al. A note on morphic characterization of languages , 1983, Discret. Appl. Math..

[2] Michel Latteux,et al. On the Composition of Morphisms and Inverse Morphisms , 1983, ICALP.

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

[4] Meera Blattner. Single-Valued a-Transducers , 1977, J. Comput. Syst. Sci..

[5] Faith Ellen,et al. A homomorphic characterization of regular languages , 1982, Discret. Appl. Math..

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

[7] Paavo Turakainen,et al. A homomorphic characterization of principal semiAFLs without using intersection with regular sets , 1982, Inf. Sci..

[8] Timothy V. Griffiths. The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.

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