The sequence equivalence problem for marked DT0L systems

DOI10.3233/FI-2011-535MaRDI QIDQ3100934zbMATH OpenOpenAlexFDO

Authors Juha Honkala

Publication date 22 November 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2011-535

zbMATH Keywords

decidabilityDT0L sequence equivalence problemDT0L systemmarked morphism

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 4045201
• The sequence equivalence problem for primitive D0L systems
• Marked D0L systems and the 2n-conjecture
• A new bound for the D0L sequence equivalence problem
• A new bound for the D0L language equivalence problem

Cited in

(6)

• scientific article; zbMATH DE number 1819637 (Why is no real title available?)
• scientific article; zbMATH DE number 4045201 (Why is no real title available?)
• scientific article; zbMATH DE number 4049063 (Why is no real title available?)
• scientific article; zbMATH DE number 4055075 (Why is no real title available?)
• scientific article; zbMATH DE number 49043 (Why is no real title available?)
• Marked D0L systems and the 2n-conjecture

This page was built for publication: The sequence equivalence problem for marked DT0L systems

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