The language equivalence problem for HD0L systems having D0L growths

DOI10.1016/J.TCS.2004.09.014zbMath1078.68086OpenAlexW1982408059MaRDI QIDQ1763705

Juha Honkala

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.014

zbMATH Keywords

D0L systemHD0L systemLanguage equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Lindenmayer Systems ⋮ The equivalence problem for languages defined by transductions on D0L languages

Cites Work

• The decidability of the DOL-DTOL equivalence problem
• Simple reductions between \(D0L\) language and sequence equivalence problems
• The decidability of the FOL-DOL equivalence problem
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• A short solution for the HDT0L sequence equivalence problem
• The equivalence problem for DF0L languages and power series.
• On sentential forms of context-free grammars
• The equivalence problem for deterministic TOL-systems is undecidable
• On the Images of ℕ-Rational Sequences Counting Multiplicities
• The decidability of the equivalence problem for DOL-systems
• On the decidability of the OL-DOL equivalence problem
• On the decidability of some equivalence problems for DOL-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The language equivalence problem for HD0L systems having D0L growths