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 languages; factor code; anti-factorial language; avoiding a word; factor automaton; factorial language; failure function; forbidden word
68Q45: Formal languages and automata
Related Items
MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS, Forty Years of Text Indexing, Reverse-Safe Text Indexing, Fast Label Extraction in the CDAWG, Building Phylogeny with Minimal Absent Words, Music Corpus Analysis Using Unwords, LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS, INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES, Words and special factors, Minimal forbidden factors of circular words, Generalizations of Code Languages with Marginal Errors, 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, Using minimal absent words to build phylogeny, Automata and differentiable words, Growth properties of power-free languages, From monomials to words to graphs., Negative selection algorithms on strings with efficient training and linear-time classification, Minimal forbidden subwords, Growth rates of complexity of power-free languages, Growth rates of power-free languages, Forbidden words in symbolic dynamics, Words and forbidden factors, Growth of power-free languages over large alphabets, A framework for space-efficient string kernels, Alignment-free sequence comparison using absent words, Reducing space for index implementation., Constructing antidictionaries of long texts in output-sensitive space, Mesosome avoidance, Combinatorics of minimal absent words for a sliding window, Absent words in a sliding window with applications, On overabundant words and their application to biological sequence analysis, WQO is decidable for factorial languages, Dynamic construction of an antidictionary with linear complexity, Word assembly through minimal forbidden words, Internal shortest absent word queries in constant time and linear space, Absent subsequences in words, RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES, Generalizations of Code Languages with Marginal Errors, One-Dimensional Tiling Semigroups and Factorial Languages, Two-Sided Bounds for the Growth Rates of Power-Free Languages
Cites Work
