scientific article; zbMATH DE number 3557270

Cited in

(24)

Detecting palindromes, patterns and borders in regular languages
Uniform data encodings
A note on the space complexity of some decision problems for finite automata
Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
Space-bounded reducibility among combinatorial problems
Polynomial and abstract subrecursive classes
On the equivalence, containment, and covering problems for the regular and context-free languages
The covering problem for linear context-free grammars
Complexity of universality and related problems for partially ordered NFAs
Decision problems and projection languages for restricted variants of two-dimensional automata
On minimizing regular expressions without Kleene star
On the complexity of decision problems for counter machines with applications to coding theory
Oblivious two-way finite automata: decidability and complexity
Descriptional and Computational Complexity of Finite Automata
On the complexity of finite, pushdown, and stack automata
Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
Partially ordered automata and piecewise testability
Descriptional and computational complexity of finite automata -- a survey
On the complexity of decision problems for some classes of machines and applications
The pumping lemma for regular languages is hard
The pumping lemma for regular languages is hard
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
Decision problems for reversible and permutation automata
Simplifying regular expressions further

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133162)