Finite Automata, Palindromes, Powers, and Patterns
From MaRDI portal
Publication:3540097
DOI10.1007/978-3-540-88282-4_7zbMath1156.68441OpenAlexW1529995230MaRDI QIDQ3540097
No author found.
Publication date: 20 November 2008
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_7
Related Items
Three New Algorithms for Regular Language Enumeration, Most pseudo-copy languages are not context-free, Finite Automata, Palindromes, Powers, and Patterns, Unary finite automata vs. arithmetic progressions, Powers of Regular Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound technique for the size of nondeterministic finite automata
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Linear prime-number sieves: A family tree
- Finite automata and unary languages
- Automata accepting primitive words
- Intersection and union of regular languages and state complexity
- Numeration systems, linear recurrences, and regular sets
- Patterns in words and languages
- Automaticity. I: Properties of a measure of descriptional complexity
- Automata, Boolean matrices, and ultimate periodicity.
- Thin and slender languages
- Relationships between nondeterministic and deterministic tape complexities
- Efficient Enumeration of Regular Languages
- Finite Automata, Palindromes, Powers, and Patterns
- Fast Pattern Matching in Strings
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
- H-bounded and semi-discrete languages
