A bound for the ω-equivalence problem of polynomial D0L systems
Department of Mathematics, University of Turku, 20014 Turku, Finland; email@example.com.
Accepted: May 2003
We give a bound for the ω-equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet.
Mathematics Subject Classification: 68Q45
Key words: Infinite words / D0L systems.
© EDP Sciences, 2003