Automata and forbidden words
From MaRDI portal
Publication:293331
DOI10.1016/S0020-0190(98)00104-5zbMath1339.68145WikidataQ61677976 ScholiaQ61677976MaRDI QIDQ293331
Filippo Mignosi, Maxime Crochemore, Antonio Restivo
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001045?np=y
formal languagesfactor codeanti-factorial languageavoiding a wordfactor automatonfactorial languagefailure functionforbidden word
Related Items (42)
RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES ⋮ Minimal forbidden subwords ⋮ INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES ⋮ Generalizations of Code Languages with Marginal Errors ⋮ Combinatorics of minimal absent words for a sliding window ⋮ From monomials to words to graphs. ⋮ WQO is decidable for factorial languages ⋮ Growth of power-free languages over large alphabets ⋮ A framework for space-efficient string kernels ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Reverse-Safe Text Indexing ⋮ Fast detection of specific fragments against a set of sequences ⋮ Absent Subsequences in Words ⋮ Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Negative selection algorithms on strings with efficient training and linear-time classification ⋮ Absent subsequences in words ⋮ Using minimal absent words to build phylogeny ⋮ Automata and differentiable words ⋮ Dynamic construction of an antidictionary with linear complexity ⋮ Growth properties of power-free languages ⋮ Fast Label Extraction in the CDAWG ⋮ Forty Years of Text Indexing ⋮ Words and special factors ⋮ MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS ⋮ Growth rates of complexity of power-free languages ⋮ Word assembly through minimal forbidden words ⋮ Minimal forbidden factors of circular words ⋮ Alignment-free sequence comparison using absent words ⋮ Building Phylogeny with Minimal Absent Words ⋮ Absent words in a sliding window with applications ⋮ One-Dimensional Tiling Semigroups and Factorial Languages ⋮ Constructing antidictionaries of long texts in output-sensitive space ⋮ Generalizations of Code Languages with Marginal Errors ⋮ Two-Sided Bounds for the Growth Rates of Power-Free Languages ⋮ Music Corpus Analysis Using Unwords ⋮ Growth rates of power-free languages ⋮ On overabundant words and their application to biological sequence analysis ⋮ LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS ⋮ Forbidden words in symbolic dynamics ⋮ Mesosome avoidance ⋮ Reducing space for index implementation. ⋮ Words and forbidden factors
Cites Work
This page was built for publication: Automata and forbidden words
