scientific article
From MaRDI portal
Publication:4055193
zbMath0301.68056MaRDI QIDQ4055193
Harry B. III Hunt, Juris Hartmanis
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items (8)
Some modifications of auxiliary pushdown automata ⋮ Space bounded computations: Review and new separation results ⋮ On the definitions of some complexity classes of real numbers ⋮ 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 ⋮ One-Time Nondeterministic Computations ⋮ Descriptional and Computational Complexity of Finite Automata
This page was built for publication:
