A new bound for the D0L sequence equivalence problem
From MaRDI portal
Publication:855272
DOI10.1007/s00236-006-0028-6zbMath1106.68060MaRDI QIDQ855272
Publication date: 5 January 2007
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-006-0028-6
68Q45: Formal languages and automata
Related Items
The equality problem for infinite words generated by primitive morphisms, D0L sequence equivalence is inPfor fixed alphabets
Cites Work
- 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
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
- A short solution for the HDT0L sequence equivalence problem
- Explicit test sets for iterated morphisms in free monoids and metabelian groups
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
- On the equivalence problem for binary DOL systems
- The decidability of the equivalence problem for DOL-systems