Variations on the technique of Ďuriš and Galil

Journal of Computer and System Sciences

Volumn 30, Issue 1, 1985, Pages 77-85

  Chrobak, Marek ^a  

^a INSTITUTE OF MATHEMATICS   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE LANGUAGES; DETERMINISTIC CONTEXT-FREE LANGUAGES; TWO-WAY DETERMINISTIC PUSHDOWN AUTOMATA;

AUTOMATA THEORY;

EID: 0022012465     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(85)90005-4     Document Type: Article

References (9)

1. Reversal complexity of counter machines
2. Nondeterminism Is Essential for Two-way Counter Machines
3. Fooling a two-way automaton or one pushdown store is better than one counter for two-way machines
4. On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
5. Some open problems in the theory of computation as questions about two-way deterministic pushdown automata languages
6. Two-way counter machines and diophantine equations
7. Transformational methods and their application to complexity problems