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

DOI10.1051/ITA:2003015zbMath1112.68394OpenAlexW2163109167MaRDI QIDQ4825477

Juha Honkala

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_2_149_0

zbMATH Keywords

Infinite wordsD0L systems.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

The equality problem for infinite words generated by primitive morphisms ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On infinite words obtained by iterating morphisms
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
• REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
• The ω sequence problem for DOL systems is decidable
• On infinite words generated by polynomial D0L systems

This page was built for publication: A bound for theω-equivalence problem of polynomial D0L systems