A bound for the omega-equivalence problem of polynomial dol systems

: Honkala J

Publisher: E D P SCIENCES

: 2003

RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications

: RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

: RAIRO-THEOR INF APPL

: 37

: 2

: 149

: 157

: 9

: 1290-385X

We give a bound for the omega-equivalence problem of poly-nomially bounded DOL systems which depends only on the size of the underlying alphabet.