The equivalence problem for DF0L languages and power series.

DOI10.1006/jcss.2002.1850zbMath1059.68062OpenAlexW2077936356MaRDI QIDQ1872710

Juha Honkala

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7d3a0b68bf129c3b70e6575ab156a68fc5542429

zbMATH Keywords

D0L systemsD0L systems with finite axiom setsequivalence problem.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Lindenmayer Systems ⋮ The language equivalence problem for HD0L systems having D0L growths ⋮ A periodicity property of iterated morphisms ⋮ On the simplification of infinite morphic words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decidability of the DOL-DTOL equivalence problem
• The decidability of the FOL-DOL equivalence problem
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• On D0L power series
• A short solution for the HDT0L sequence equivalence problem
• The decidability of the equivalence problem for DOL-systems
• On the decidability of the OL-DOL equivalence problem
• On Sequences Defined by D0L Power Series
• On the decidability of some equivalence problems for DOL-systems

This page was built for publication: The equivalence problem for DF0L languages and power series.