The following pages link to (Q4133162):
Displaying 20 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Simplifying regular expressions further (Q820947) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- Uniform data encodings (Q1134520) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Decision problems and projection languages for restricted variants of two-dimensional automata (Q2029491) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- On the complexity of decision problems for counter machines with applications to coding theory (Q2163996) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- (Q4989409) (← links)
- On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
