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
••
18 Jul 2014TL;DR: In this paper, a deterministic Rabin automata for an LTL formula is presented, which is the product of a master automaton and an array of slave automata, one for each G-subformula of i¾?.
Abstract: We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of i¾?. The slave automaton for G i¾? is in charge of recognizing whether FG i¾? holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.
67 citations
••
TL;DR: In this paper, the structure of the soliton cellular automaton is studied by means of combinatorial techniques, and it is shown that the shape of the Young tableaux gives an infinite number of time invariants of the automaton.
66 citations
•
28 Sep 2006TL;DR: In this article, an answer automaton is constructed to answer one or more queries of semistructured data, based at least in part on the queries and on a schema of the data.
Abstract: To answer one or more queries of semistructured data, an answer automaton is constructed, based at least in part on the queries and on a schema of the data. The answer automaton is applied to the data to answer the queries. Preferably, to construct the answer automaton, a schema automaton is constructed for the schema, a query automaton is constructed for the queries, and the schema automaton and the query automaton are merged. If there are more than one query, separate query automata are constructed for the different queries and then are united to provide a joint query automaton. Preferably, all the automata are deterministic finite automata. Most preferably, all the automata are isostate automata.
65 citations
••
01 Mar 1999TL;DR: JFLAP is enhanced to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA.
Abstract: An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and running nondeterministic versions of finite automata, pushdown automata, and Turing machines. Recently, we have enhanced JFLAP to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA. In addition, our enhancements combined with other tools allow one to interactively study LL and LR parsing methods.
65 citations
••
01 Dec 1983
TL;DR: It is shown that alternation corresponds to one more iteration of pushdowns, and nondeterministic 2-way and multi-head iterated pushdown automata characterize deterministic iterated exponential time complexity classes.
Abstract: An iterated pushdown is a pushdown of pushdowns of ... of pushdowns. An iterated exponential function is 2 to the 2 to the ... to the 2 to some polynomial. The main result is that nondeterministic 2-way and multi-head iterated pushdown automata characterize deterministic iterated exponential time complexity classes. This is proved by investigating both nondeterministic and alternating auxiliary iterated pushdown automata, for which similar characterization results are given. In particular it is shown that alternation corresponds to one more iteration of pushdowns. These results are applied to the 1-way iterated pushdown automata: (1) they form a proper hierarchy with respect to the number of iterations, (2) their emptiness problem is complete in deterministic iterated exponential time.
64 citations