Equality sets of morphic word sequences

DOI10.1142/S0129054112500268MaRDI QIDQ2841980zbMATH OpenFDO

Authors Juha Honkala

Publication date 30 July 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054112500268

zbMATH Keywords

D0L sequencedecidabilityequality setHD0L sequenceperiodicity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• D0L sequences and their equality sets
• Equality sets of binary D0L sequences
• A new bound for the D0L sequence equivalence problem
• The sequence equivalence problem for primitive D0L systems
• scientific article; zbMATH DE number 4045201

Cites work

• A short solution for the HDT0L sequence equivalence problem
• A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
• D0L sequence equivalence is inPfor fixed alphabets
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• On some decidability problems for HDOL systems with nonsingular Parikh matrices
• On the equivalence problem for binary DOL systems
• The decidability of the equivalence problem for DOL-systems
• The ultimate equivalence problem for DOL systems

Cited in

(7)

• Equality sets of binary D0L sequences
• Logarithmic equal-letter runs for BWT of purely morphic words
• Morphic words and equidistributed sequences
• On the Images of ℕ-Rational Sequences Counting Multiplicities
• Large Simple Binary Equality Words
• D0L sequences and their equality sets
• Languages defined by generalized equality sets.

This page was built for publication: Equality sets of morphic word sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841980)