A defect theorem for bi-infinite words.

DOI10.1016/S0304-3975(01)00225-0zbMath1063.68069MaRDI QIDQ1853742

Wojciech Plandowski, Ján Maňuch, Juhani Karhumäki

Publication date: 22 January 2003

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

zbMATH Keywords

Bi-infinite wordsDefect theorems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Many aspects of defect theorems ⋮ Recognizability of morphisms ⋮ Defect theorem in the plane ⋮ How Many Figure Sets Are Codes? ⋮ On the conjugacy class of the Fibonacci dynamical system ⋮ The commutation of finite sets: A challenging problem ⋮ Multiple factorizations of words and defect effect

Cites Work

• On the defect theorem and simplifiability
• Sur le théorème du defaut
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A defect theorem for bi-infinite words.