The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet

DOI10.1007/s00224-002-1075-1zbMath1039.68067OpenAlexW2067341065MaRDI QIDQ1405801

Juha Honkala

Publication date: 26 August 2003

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

Full work available at URL: https://doi.org/10.1007/s00224-002-1075-1

zbMATH Keywords

sequence equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

THE BASE PROBLEM FOR D0L PARIKH SETS, A new bound for the D0L sequence equivalence problem, A bound for theω-equivalence problem of polynomial D0L systems, 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 the simplification of infinite morphic words, Unnamed Item, THE D0L ω-EQUIVALENCE PROBLEM, An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet