Subword Complexity and k-Synchronization

DOI10.1007/978-3-642-38771-5_23zbMath1381.68234arXiv1206.5352OpenAlexW1768688475MaRDI QIDQ5300845

Daniel Goč, Luke Schaeffer, Jeffrey O. Shallit

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.5352

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (12)

How to prove that a sequence is not automatic ⋮ Automatic sequences of rank two ⋮ Mechanical Proofs of Properties of the Tribonacci Word ⋮ Synchronized sequences ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Abelian Complexity and Synchronization ⋮ Dyck Words, Pattern Avoidance, and Automatic Sequences ⋮ Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties ⋮ General Framework ⋮ First-Order Logic and Numeration Systems ⋮ Additive number theory via automata theory ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles

This page was built for publication: Subword Complexity and k-Synchronization