Transformational methods and their application to complexity problems. Corrigenda
From MaRDI portal
Publication:1241509
DOI10.1007/BF00271346zbMath0365.02026MaRDI QIDQ1241509
Publication date: 1977
Published in: Acta Informatica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)
Related Items (14)
Refined simulation of multihead automata ⋮ Hierarchies of one-way multihead automata languages ⋮ Cyclic automata ⋮ k\(+1\) heads are better than k for PDAs ⋮ Alternating multihead finite automata ⋮ Halting space-bounded computations ⋮ Unnamed Item ⋮ Fooling a two way automaton or one pushdown store is better than one counter for two way machines ⋮ NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES ⋮ On the descriptional power of heads, counters, and pebbles ⋮ Properties of probabilistic pushdown automata ⋮ Properties of probabilistic pushdown automata ⋮ Deterministic two-way one-head pushdown automata are very powerful ⋮ Multi-head finite automata: Data-independent versus data-dependent computations
This page was built for publication: Transformational methods and their application to complexity problems. Corrigenda
