Local Squares, Periodicity and Finite Automata

DOI10.1007/978-3-642-19391-0_7zbMath1327.68182OpenAlexW2145467658MaRDI QIDQ3003473

Juhani Karhumäki, Aleksi Saarela, Kalle Saari, Mari Huova

Publication date: 27 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19391-0_7

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

On Growth and Fluctuation of k-Abelian Complexity ⋮ On growth and fluctuation of \(k\)-abelian complexity ⋮ On \(k\)-abelian avoidability ⋮ \(k\)-abelian pattern matching ⋮ On some generalizations of abelian power avoidability ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ k-Abelian Equivalence and Rationality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly non-repetitive sequences and progression-free sets
• Periodicity and the golden ratio
• Locally periodic versus globally periodic infinite words
• Unending chess, symbolic dynamics and a problem in semi-groups
• On abelian versions of critical factorization theorem

This page was built for publication: Local Squares, Periodicity and Finite Automata