scientific article; zbMATH DE number 3575000
From MaRDI portal
Publication:4144808
zbMath0368.68069MaRDI QIDQ4144808
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Turing machines and related notions (03D10)
Related Items (14)
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes ⋮ Unnamed Item ⋮ Some observations concerning alternating Turing machines using small space ⋮ Unnamed Item ⋮ On some variations of two-way probabilistic finite automata models ⋮ On eliminating nondeterminism from Turing machines which use less than logarithm worktape space ⋮ An NP-complete language accepted in linear time by a one-tape Turing machine ⋮ A survey of space complexity ⋮ A lower bound for the nondeterministic space complexity of context-free recognition ⋮ A relationship between nondeterministic turing machines and 1-inkdot turing machines with small space ⋮ Bracket-languages are recognizable in logarithmic space ⋮ Lower bounds on space complexity for contextfree recognition ⋮ Complexity of some problems concerningL systems ⋮ Sur une propriété d'itération des langages algébriques déterministes
This page was built for publication:
