Deterministic two-way one-head pushdown automata are very powerful

Authors:
B Monien
Affiliations:
Univ. of Paderborn, Paderborn, Fed. Rep. Germany
Venue:
Information Processing Letters - Lecture Notes in Computer Science, no. 173
Year:
1984

Citing 0
Cited 5

Two-way one-counter automata accepting bounded languages

ACM SIGACT News
Language recognition by two-way deterministic pushdown automata

Cybernetics and Systems Analysis
Interference automata

Theoretical Computer Science
Generalized counters and reversal complexity

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Descriptional complexity of two-way pushdown automata with restricted head reversals

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract