Easy cases of the D0L sequence equivalence problem

DOI10.1016/S0166-218X(01)00187-1zbMath1001.68066MaRDI QIDQ5951971

Juha Honkala

Publication date: 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

D0L systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Uni-transitional Watson-Crick D0L systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a bound for the DOL sequence equivalence problem
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• A short solution for the HDT0L sequence equivalence problem
• On the equivalence problem for binary DOL systems
• The decidability of the equivalence problem for DOL-systems
• On the decidability of some equivalence problems for DOL-systems

This page was built for publication: Easy cases of the D0L sequence equivalence problem