Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-06-15T19:02:37.838Z Has data issue: false hasContentIssue false

A bound for the ω-equivalence problem of polynomial D0L systems

Published online by Cambridge University Press:  15 November 2003

Juha Honkala*
Affiliation:
Department of Mathematics, University of Turku, 20014 Turku, Finland; juha.honkala@utu.fi.
Get access

Abstract

We give a bound for the ω-equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet.

Type
Research Article
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Culik II, K. and Harju, T., The ω-sequence equivalence problem for D0L systems is decidable. J. ACM 31 (1984) 282-298. CrossRef
Culik II, K. and Salomaa, A., On infinite words obtained by iterating morphisms. Theoret. Comput. Sci. 19 (1982) 29-38. CrossRef
Ehrenfeucht, A. and Rozenberg, G., Elementary homomorphisms and a solution of the D0L sequence equivalence problem. Theoret. Comput. Sci. 7 (1978) 169-183. CrossRef
Honkala, J., On infinite words generated by polynomial D0L systems. Discrete Appl. Math. 116 (2002) 297-305. CrossRef
Honkala, J., Remarks concerning the D0L ω-equivalence problem. Intern. J. Found. Comput. Sci. 13 (2002) 769-777. CrossRef
Honkala, J., The equivalence problem of polynomially bounded D0L systems - a bound depending only on the size of the alphabet. Theory Comput. Systems 36 (2003) 89-103. CrossRef
G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. Academic Press, New York (1980).
G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vols. 1-3. Springer, Berlin (1997).
Salomaa, A., On exponential growth in Lindenmayer systems. Indag. Math. 35 (1973) 23-30. CrossRef