Marked D0L systems and the \(2n\)-conjecture

DOI10.1016/J.TCS.2012.01.037zbMath1242.68145OpenAlexW2032418844WikidataQ122877883 ScholiaQ122877883MaRDI QIDQ428859

Juha Honkala

Publication date: 25 June 2012

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

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

zbMATH Keywords

decidabilitymarked morphismD0L sequence equivalence problemD0L system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• A short solution for the HDT0L sequence equivalence problem
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• D0L sequence equivalence is inPfor fixed alphabets
• On the equivalence problem for binary DOL systems
• The decidability of the equivalence problem for DOL-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Marked D0L systems and the \(2n\)-conjecture