The equality problem for purely substitutive words

DOI10.1017/CBO9780511777653.011zbMath1216.68209OpenAlexW2506966049MaRDI QIDQ5393504

Juha Honkala

Publication date: 18 April 2011

Published in: Combinatorics, Automata and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9780511777653.011

zbMATH Keywords

equality problemD0L \(\omega\)-equivalence problempurely substitutive words

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Symbolic dynamics (37B10)

Related Items (3)

Sturmian images of non Sturmian words and standard morphisms ⋮ The signature of rational languages ⋮ On infinite words determined by L systems

This page was built for publication: The equality problem for purely substitutive words