Abstract
It is shown that for every compositionτ of morphisms and inverse morphisms there exist morphismsh 1,h 2,h 3, andh 4 such that\(\tau = h_4^{ - 1} \circ h_3 \circ h_2^{ - 1} \circ h_1 \). This solves a problem raised by Latteux and Leguy [5] and partially solved by Turakainen [8], [9].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Berstel,Transductions and Context-Free Languages, B. G. Teubner, Stuttgart, 1979.
K. Culik II, F. E. Fich, and A. Salomaa, A homomorphic characterization of regular languages,Discrete Appl. Math.,4 (1982), 149–152.
S. Ginsburg,Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.
J. Karhumäki and M. Linna, A note on morphic characterization of languages,Discrete Appl. Math.,5 (1983), 243–246.
M. Latteux and J. Leguy, On the composition of morphisms and inverse morphisms,Lecture Notes Comput. Sci.,154 (1983), 420–432.
A. Salomaa,Theory of Automata, Pergamon Press, Oxford, 1969.
P. Turakainen, A homomorphic characterization of principal semiAFLs without using intersection with regular sets,Inform. Sci.,27 (1982), 141–149.
P. Turakainen, A machine-oriented approach to compositions of morphisms and inverse morphisms,EATCS Bull.,20 (1983), 162–166.
P. Turakainen, Transducers and compositions of morphisms and inverse morphisms,Ann. Univ. Turku. Ser. A I,186 (1984), 118–128.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Latteux, M., Turakainen, P. A new normal form for the compositions of morphisms and inverse morphisms. Math. Systems Theory 20, 261–271 (1987). https://doi.org/10.1007/BF01692069
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01692069