Theoretical Computer Science
Structural complexity 1
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
A Generalization of Ogden's Lemma
Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A geometric hierarchy of languages
Journal of Computer and System Sciences
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On input-revolving deterministic and nondeterministic finite automata
Information and Computation
DLT'07 Proceedings of the 11th international conference on Developments in language theory
An automata-theoretical characterization of context-free trace languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Gaining power by input operations: finite automata and beyond
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Hybrid extended finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Revolving-input finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
Input-reversal pushdown automata are pushdown automata with the additional power to reverse the unread part of the input. We show that these machines characterize the family of linear context-free indexed languages, and that k + 1 input reversals are better than k for both deterministic and nondeterministic input-reversal pushdown automata, i.e., there are languages which can be recognized by a deterministic input-reversal pushdown automaton with k + 1 input reversals but which cannot be recognized with k input reversals (deterministic or nondeterministic). In passing, input-reversal finite automata are investigated. Moreover, an inherent relation between input-reversal pushdown automata and controlled linear context-free languages are shown, leading to an alternative description of Khabbaz geometric hierarchy of languages by input-reversal iterated pushdown automata. Finally, some computational complexity problems for the investigated language families are considered.