The sequence equivalence problem for primitive D0L systems

DOI10.1016/J.JCSS.2012.05.013zbMath1261.68089OpenAlexW2056348854MaRDI QIDQ1936250

Juha Honkala

Publication date: 21 February 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.05.013

zbMATH Keywords

decidabilityequivalence problemD0L systemprimitive morphism

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (1)

The equality problem for infinite words generated by primitive morphisms

This page was built for publication: The sequence equivalence problem for primitive D0L systems