Automata and forbidden words
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3956447
- Automata and dictionaries.
- scientific article; zbMATH DE number 4071019
- scientific article; zbMATH DE number 1121923
- scientific article; zbMATH DE number 1222602
- scientific article; zbMATH DE number 53545
- scientific article; zbMATH DE number 130894
- scientific article; zbMATH DE number 871446
- Words and forbidden factors
- Automata and differentiable words
Cites work
Cited in
(49)- Growth rates of power-free languages
- Forbidden words in symbolic dynamics
- Words and forbidden factors
- Growth of power-free languages over large alphabets
- 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
- scientific article; zbMATH DE number 1222602 (Why is no real title available?)
- Using minimal absent words to build phylogeny
- Automata and differentiable words
- Minimal forbidden words and symbolic dynamics
- Growth properties of power-free languages
- 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
- From monomials to words to graphs.
- 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
- Generalizations of Code Languages with Marginal Errors
- Negative selection algorithms on strings with efficient training and linear-time classification
- Minimal absent words in rooted and unrooted trees
- Linear-time computation of generalized minimal absent words for multiple strings
- Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
- Subproduct systems and Cartesian systems: new results on factorial languages and their relations with other areas
- Missing value replacement in strings and applications
- Efficient computation of discriminative absent words for string collections
- Transformations between minimally f-free words
- Minimal forbidden subwords
- Growth rates of complexity of power-free languages
This page was built for publication: Automata and forbidden words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293331)
