Detecting palindromes, patterns and borders in regular languages
From MaRDI portal
Recommendations
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- Automata accepting primitive words
- Automata, Boolean matrices, and ultimate periodicity.
- Automaticity. I: Properties of a measure of descriptional complexity
- Efficient Enumeration of Regular Languages
- Fast Pattern Matching in Strings
- Finite automata and unary languages
- H-bounded and semi-discrete languages
- scientific article; zbMATH DE number 2186384 (Why is no real title available?)
- scientific article; zbMATH DE number 4033111 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3557270 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1261119 (Why is no real title available?)
- scientific article; zbMATH DE number 724794 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2087216 (Why is no real title available?)
- scientific article; zbMATH DE number 2201362 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- Introduction to algorithms
- Linear prime-number sieves: A family tree
- Numeration systems, linear recurrences, and regular sets
- Patterns in words and languages
- Relationships between nondeterministic and deterministic tape complexities
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The maximum order of an element of a finite symmetric group.
- Theory Is Forever
- Thin and slender languages
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
Cited in
(18)- From decidability to undecidability by considering regular sets of instances
- Automata equipped with auxiliary data structures and regular realizability problems
- On expressive power of regular realizability problems
- On regular realizability problems for context-free languages
- Finite Automata, Palindromes, Powers, and Patterns
- Descriptional and Computational Complexity of Finite Automata
- Approximate On-line Palindrome Recognition, and Applications
- Markers and deterministic acceptors for non-deterministic languages
- Decidability and shortest strings in formal languages
- Regular Realizability Problems and Context-Free Languages
- Open problems related to palindrome recognition: are there open problems related to palindrome recognition?
- Descriptional and computational complexity of finite automata -- a survey
- Properties of graphs specified by a regular language
- Properties of graphs specified by a regular language
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
- Decision problems on copying and shuffling
- Automata equipped with auxiliary data structures and regular realizability problems
- Detecting patterns in finite regular and context-free languages
This page was built for publication: Detecting palindromes, patterns and borders in regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041028)
