scientific article; zbMATH DE number 3454792

zbMath0289.68015MaRDI QIDQ4778268

Burkhard Monien

Publication date: 1974

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

Universal quantifiers and time complexity of random access machines, Refined simulation of multihead automata, Alternating multihead finite automata, A recursive and a grammatical characterization of the exponential-time languages, Deterministic two-way one-head pushdown automata are very powerful