Marked D0L systems and the 2n-conjecture

DOI10.1016/J.TCS.2012.01.037zbMATH Open1242.68145OpenAlexW2032418844WikidataQ122877883 ScholiaQ122877883MaRDI QIDQ428859FDOQ428859

Authors: 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

Recommendations

• Easy cases of the D0L sequence equivalence problem
• The sequence equivalence problem for primitive D0L systems
• The sequence equivalence problem for marked DT0L systems
• A new bound for the D0L sequence equivalence problem
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet

zbMATH Keywords

decidabilityD0L sequence equivalence problemD0L systemmarked morphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the equivalence problem for binary DOL systems
• The decidability of the equivalence problem for DOL-systems

Cited In (2)

• Easy cases of the D0L sequence equivalence problem
• The sequence equivalence problem for marked DT0L systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428859)