Equality sets of binary D0L sequences

DOI10.1016/j.tcs.2018.05.011zbMath1395.68191OpenAlexW2803442755MaRDI QIDQ1637341

Juha Honkala

Publication date: 8 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.011

zbMATH Keywords

D0L systemeventual periodicitybinary morphismD0L equality set

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some decidability problems for HDOL systems with nonsingular Parikh matrices
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• A short solution for the HDT0L sequence equivalence problem
• Binary equality sets are generated by two words
• EQUALITY SETS OF MORPHIC WORD SEQUENCES
• D0L sequence equivalence is inPfor fixed alphabets
• On the equivalence problem for binary DOL systems
• The decidability of the equivalence problem for DOL-systems
• D0L Sequences and their Equality Sets

This page was built for publication: Equality sets of binary D0L sequences