Structural complexity 1
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
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
Mathematical Theory of L Systems
Mathematical Theory of L Systems
On input-revolving deterministic and nondeterministic finite automata
Information and Computation
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03 Proceedings of the 7th international conference on Developments in language theory
DLT'07 Proceedings of the 11th international conference on Developments in language theory
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
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Input-Driven queue automata: finite turns, decidability, and closure properties
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
Flip-pushdown automata are pushdown automata with the additional power to flip or reverse its pushdown, and were recently introduced by Sarkar [13]. We solve most of Sarkar's open problems. In particular, we show that k+1 pushdown reversals are better than k for both deterministic and nondeterministic flip-pushdown automata, i.e., there are languages which can be recognized by a deterministic flip-pushdown automaton with k+1 pushdown reversals but which cannot be recognized by a k-flip-pushdown (deterministic or nondeterministic). Furthermore, we investigate closure and non-closure properties as well as computational complexity problems such as fixed and general membership.