Abstract
The notion of a morphic replication is extended by replacing morphisms with deterministic generalized sequential machines (dgsm). As is well-known, the equivalence problem for gsm mappings is undecidable, whereas for dgsm mappings or morphic replications it is decidable. It is shown that, more generally, two dgsm replications τ 1 and τ 2 are equivalent on a Q-rational language L if and only if τ 1(w)=τ 2(w) for all w in L such that the length of w does not exceed a certain polynomial bound whose parameters are the numbers of dgsm's in τ 1 and τ 2, the cardinalities of their state sets, and the size n of the Q-matrix system accepting L. Accordingly, two dgsm's with k 1 and k 2 states, respectively, are equivalent on L if and only if they are (2nk 1+2nk 2−1)-equivalent on it. A corresponding result is derived for the morphic replication equivalence on linear languages.
The above results provide an algorithm being of exponential time complexity. Polynomial time bounds for the dgsm equivalence and the morphic replication equivalence on Q-rational languages are found by means of the result that the emptiness problem for Q-rational languages is decidable in polynomial time.
Finally, a modified dgsm replication is defined, and it is shown that both the original and the modified dgsm replication equivalence problems are decidable for any family of languages satisfying certain conditions. One such family consists of languages given in the form τ(L) where τ is a morphic replication and L is a Q-rational language.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “The Design and Analysis of Computer Algorithms,” Addison-Wesley, Reading, Massachusetts, 1975.
H. Anton and C. Rorres, “Elementary Linear Algebra with Applications,” John Wiley & Sons, Inc., Singapore, 1987.
R. V. Book, S. A. Greibach, and C. Wrathall, Reset machines, J. Comput. System Sci. 19 (1979), 256–276.
S. Ginsburg and E. H. Spanier, AFL with the semilinear property, J. Comput. System Sci. 5 (1971), 365–396.
S. A. Greibach, Syntactic operators on full semiAFLs, J. Comput. System Sci. 6 (1972), 30–76.
S. A. Greibach, One way finite visit automata, Theor. Comput. Sci. 6 (1978), 175–221.
S. Horváth, J. Karhumäki, and J. Kleijn, Results concerning palindromicity, J. Inform. Process. Cybern. 23 (1987), 441–451.
O. H. Ibarra, 2DST mappings on languages and related problems, Theor. Comput. Sci. 19 (1982), 219–227.
R. Kannan and A. Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, Siam J. Comput. 8 (1979), 499–506.
A. Salomaa and M. Soittola, “Automata-Theoretic Aspects of Formal Power Series,” Springer-Verlag, Berlin, Heidelberg, New York, 1978.
P. Turakainen, Generalized automata and stochastic languages, Proc. Amer. Math. Soc. 21 (1969), 303–309.
P. Turakainen, On some transducer equivalence problems for families of languages, Internat. J. Comput. Math. 23 (1988), 99–124.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turakainen, P. (1988). The equivalence of dgsm replications on Q-rational languages is decidable. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_148
Download citation
DOI: https://doi.org/10.1007/3-540-19488-6_148
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19488-0
Online ISBN: 978-3-540-39291-0
eBook Packages: Springer Book Archive