scientific article
From MaRDI portal
Publication:3793732
zbMath0648.68063MaRDI QIDQ3793732
Ivana Štefáneková, Andrej Bebják
Publication date: 1988
Full work available at URL: https://eudml.org/doc/27584
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Fooling a two-way nondeterministic multihead automaton with reversal number restriction
- One way multihead deterministic finite automata
- The reduction of tape reversals for off-line one-tape Turing machines
- One-way multihead writing finite automata
- k + 1 Heads Are Better than k
- Note on tape reversal complexity of languages
This page was built for publication:
