Abstract
We show that we cannot effectively determine whether, for morphismsα i ,β i ,card (uα −10 α 1) =card(uβ −10 β 1) for all wordsu over the domain alphabets of the two given compositions. In contrast it is decidable for morphismsα i ,β i and a regular setR whethercard(uα 0 α −11 ) =card(uβ 0 β −11 ) for all wordsu inR. In order to prove the latter result we give a characterization of the multiplicity functions of simple finite automata by using cardinalities of compositions of the above form. Finally, we show that the above decidability result also holds when we consider rational functions rather than morphisms.
Similar content being viewed by others
References
J. Berstel,Transductions and Context-Free Languages, Teubner, Stuttgart, 1979.
M. Blattner, T. Head, Single-valueda-transducers,J. Comput. System Sci.,15 (1977), 310–327.
L. Boasson, M. Nivat, Sur diverses familles de languages fermées par transduction rationnelle,Acta Inform.,2 (1973), 180–188.
S. Eilenberg,Automata, Languages, and Machines, Vol. A, Academic Press, New York, 1974.
T. V. Griffiths, The unsolvability of the equivalence problem for A-free nondeterministic generalized sequential machines,J. Assoc. Comput. Mach.,15 (1968), 409–413.
M. A. Harrison,Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
J. Karhumäki, H. C. M. Kleijn, On the equivalence of compositions of morphisms and inverse morphisms on regular languages,RAIRO Inform. Théor.,19 (1985), 203–211.
M. Latteux, J. Leguy,On the Composition of Morphisms and Inverse Morphisms, Lecture Notes in Computer Science, Vol. 154, Springer-Verlag, Berlin, 1983, pp. 420–432.
M. P. Schützenberger, Sur les rélations rationnelles entre monoides libres,Theoret. Comput. Sci.,3 (1976), 243–259.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Harju, T., Kleijn, H.C.M. Cardinality problems of compositions of morphisms and inverse morphisms. Math. Systems Theory 22, 151–159 (1989). https://doi.org/10.1007/BF02088295
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02088295