The following pages link to Automata and forbidden words (Q293331):
Displaying 44 items.
- Using minimal absent words to build phylogeny (Q442159) (← links)
- Automata and differentiable words (Q442244) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- From monomials to words to graphs. (Q598451) (← links)
- Negative selection algorithms on strings with efficient training and linear-time classification (Q627104) (← links)
- Minimal forbidden subwords (Q834943) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- Forbidden words in symbolic dynamics (Q1585506) (← links)
- Words and forbidden factors (Q1605329) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- Constructing antidictionaries of long texts in output-sensitive space (Q2048208) (← links)
- Mesosome avoidance (Q2094370) (← links)
- Combinatorics of minimal absent words for a sliding window (Q2163388) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Absent subsequences in words (Q2695493) (← links)
- RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES (Q3444851) (← links)
- Generalizations of Code Languages with Marginal Errors (Q3451108) (← links)
- One-Dimensional Tiling Semigroups and Factorial Languages (Q3618541) (← links)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248) (← links)
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS (Q4680582) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Reverse-Safe Text Indexing (Q5102053) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- Building Phylogeny with Minimal Absent Words (Q5200056) (← links)
- Music Corpus Analysis Using Unwords (Q5237286) (← links)
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS (Q5247167) (← links)
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES (Q5291302) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)
- Words and special factors (Q5941274) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
- Minimal absent words in rooted and unrooted trees (Q6536250) (← links)
- Linear-time computation of generalized minimal absent words for multiple strings (Q6545442) (← links)
- Some inner metric parameters of a digraph: iterated line digraphs and integer sequences (Q6655972) (← links)
