Topic
Pushdown automaton
About: Pushdown automaton is a research topic. Over the lifetime, 1868 publications have been published within this topic receiving 35399 citations.
Papers published on a yearly basis
Papers
More filters
20 Jun 1990
TL;DR: It is shown that every pushdown automaton can be transformed into a graph grammar generating its transition graph, and that this transformation can be applied to any graph grammar.
Abstract: We saw (in section 1) that we can transform every pushdown automaton into a graph grammar generating its transition graph.
37 citations
30 Jun 2003
TL;DR: It is shown that k+1 pushdown reversals are better than k for both deterministic and nondeterministic flip-pushdown automata, and closure and non-closure properties as well as computational complexity problems such as fixed and general membership are investigated.
Abstract: 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.
37 citations
TL;DR: For every finite k, it is shown that the tradeoff from a description by a PDA with ambiguity k and nondeterminism k is bounded by no recursive function.
37 citations
25 Jun 2012
TL;DR: It is shown that deterministic collapsible pushdown automata of second level can recognize a language which is not recognizable by any deterministic higher order push down automaton (without collapse) of any level.
Abstract: We show that deterministic collapsible pushdown automata of second level can recognize a language which is not recognizable by any deterministic higher order pushdown automaton (without collapse) of any level. This implies that there exists a tree generated by a second level collapsible pushdown system (equivalently: by a recursion scheme of second level), which is not generated by any deterministic higher order pushdown system (without collapse) of any level (equivalently: by any safe recursion scheme of any level). As a side effect, we present a pumping lemma for deterministic higher order pushdown automata, which potentially can be useful for other applications.
36 citations
TL;DR: In this paper, a new family of ω-languages (sets of infinite sequences) associated with context-free languages and pushdown automata are introduced, and their basic properties, such as inclusion relations, closure under the Boolean operations and periodicity, are studied and compared with the corresponding properties of the families accepted by finite automata.
Abstract: New families of ω-languages (sets of infinite sequences) associated with context-free languages and pushdown automata are introduced. Their basic properties, such as inclusion relations, closure under the Boolean operations and periodicity, are studied and compared with the corresponding properties of the families of ω-languages accepted by finite automata. Moreover, a number of solvability and unsolvability results are proved. The results obtained imply that there is a definite difference between the family of ω-languages accepted by pushdown automata and the family associated with context-free languages.
36 citations