New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing
Regularity and Related Problems for Deterministic Pushdown Automata
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Descriptional complexity of cellular automata and decidability questions
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
On recursive and non-recursive trade-offs between finite-turn pushdown automata
Journal of Automata, Languages and Combinatorics
Reversal-bounded multipushdown machines
Journal of Computer and System Sciences
More concise representation of regular languages by automata and regular expressions
Information and Computation
Descriptional complexity of bounded context-free languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Handbook of Discrete and Combinatorial Mathematics, Second Edition
Handbook of Discrete and Combinatorial Mathematics, Second Edition
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
| Hi-index | 0.00 |
Two-way nondeterministic pushdown automata (2PDA) are classical nondeterministic pushdown automata (PDA) enhanced with two-way motion of the input head. In this paper, the subclass of 2PDA accepting bounded languages and making at most a constant number of input head turns is studied with respect to descriptional complexity aspects. In particular, the effect of reducing the number of pushdown reversals to a constant number is of interest. It turns out that this reduction leads to an exponential blow-up in case of nondeterministic devices, and to a doubly-exponential blow-up in case of deterministic devices. If the restriction on boundedness of the languages considered and on the finiteness of the number of head turns is dropped, the resulting trade-offs are no longer bounded by recursive functions, and so-called nonrecursive trade-offs are shown.