A polynomial bound for certain cases of the D0L sequence equivalence problem

DOI10.1007/s00224-001-0001-2zbMath0988.68106OpenAlexW2037981564MaRDI QIDQ5945725

Juha Honkala

Publication date: 30 June 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-0001-2

zbMATH Keywords

D0L sequence equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Bounds for the D0L language equivalence problem ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ Explicit test sets for iterated morphisms in free monoids and metabelian groups ⋮ On infinite words generated by polynomial D0L systems