RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

Issue		Theoret. Informatics Appl. Volume 37, Number 2, April-June 2003
Page(s)		149 - 157
DOI		10.1051/ita:2003015

Theoret. Informatics Appl. 37, 149-157 (2003)
DOI: 10.1051/ita:2003015

A bound for the $\mathsf{\omega}$ -equivalence problem of polynomial D0L systems

Juha Honkala

Department of Mathematics, University of Turku, 20014 Turku, Finland; juha.honkala@utu.fi.

(Received August, 2002. Accepted May, 2003.)

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

What is OpenURL?

A bound for the -equivalence problem of polynomial D0L systems

A bound for the $\mathsf{\omega}$ -equivalence problem of polynomial D0L systems