Minimal forbidden factors of circular words

DOI10.1007/978-3-319-66396-8_5zbMath1405.68261arXiv1707.04450OpenAlexW2964300592MaRDI QIDQ5915743

Antonio Restivo, Gabriele Fici, Laura Rizzo

Publication date: 15 November 2017

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

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

zbMATH Keywords

finite automatonFibonacci wordsfactor automatoncircular wordL-automatonminimal forbidden factor

Mathematics Subject Classification ID

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

Related Items

Internal shortest absent word queries in constant time and linear space ⋮ Reverse-Safe Text Indexing ⋮ Absent Subsequences in Words ⋮ Absent subsequences in words ⋮ Minimal forbidden factors of circular words ⋮ Alignment-free sequence comparison using absent words

Cites Work

• Unnamed Item
• Unnamed Item
• Automata and forbidden words
• Using minimal absent words to build phylogeny
• Special factors and the combinatorics of suffix and factor automata
• The structure of subword graphs and suffix trees of Fibonacci words
• Some combinatorial properties of Sturmian words
• Forbidden words in symbolic dynamics
• Words and forbidden factors
• Alignment-free sequence comparison using absent words
• Transducers and repetitions
• The sequence of open and closed prefixes of a Sturmian word
• Word assembly through minimal forbidden words
• Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Fast Pattern Matching in Strings
• Minimal forbidden factors of circular words