scientific article; zbMATH DE number 3557270

zbMath0357.68090MaRDI QIDQ4133162

Harry B. III Hunt

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (21)

Simplifying regular expressions further ⋮ On minimizing regular expressions without Kleene star ⋮ On the complexity of decision problems for counter machines with applications to coding theory ⋮ Uniform data encodings ⋮ Unnamed Item ⋮ On the complexity of decision problems for some classes of machines and applications ⋮ The pumping lemma for regular languages is hard ⋮ 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 ⋮ Oblivious two-way finite automata: decidability and complexity ⋮ 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 ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ 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 ⋮ Decision problems and projection languages for restricted variants of two-dimensional automata ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ Detecting palindromes, patterns and borders in regular languages

This page was built for publication: