scispace - formally typeset
Search or ask a question
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
More filters
Posted Content
TL;DR: This work presents an architecture for integrating real-time, multimodal input into a computational agent's contextual model and presents examples of this architecture's use in multi-modality one-shot learning interactions of novel gestures and live action composition.
Abstract: We present an architecture for integrating real-time, multimodal input into a computational agent's contextual model. Using a human-avatar interaction in a virtual world, we treat aligned gesture and speech as an ensemble where content may be communicated by either modality. With a modified nondeterministic pushdown automaton architecture, the computer system: (1) consumes input incrementally using continuation-passing style until it achieves sufficient understanding the user's aim; (2) constructs and asks questions where necessary using established contextual information; and (3) maintains track of prior discourse items using multimodal cues. This type of architecture supports special cases of pushdown and finite state automata as well as integrating outputs from machine learning models. We present examples of this architecture's use in multimodal one-shot learning interactions of novel gestures and live action composition.

6 citations

Proceedings ArticleDOI
18 Oct 1967
TL;DR: This paper shows two properties of stack automata with a one-way input: if a language is accepted by a nondeterministic one- way stack automaton, then it is acceptance by a deterministic linear bounded automaton.
Abstract: A stack automaton is a device with a pushdown list which can be read by its storage head in a read only mode In this paper, we show two properties of stack automata with a one-way input (1) If a language is accepted by a nondeterministic one-way stack automaton, then it is accepted by a deterministic linear bounded automaton (2) If a language, L, is accepted by a deterministic one-way stack automaton, and R is a regular set, then L/R = {x for some y in R, xy is in L} is accepted by a deterministic one-way stack automaton

6 citations

Book ChapterDOI
24 Jun 2009
TL;DR: The characterizations can be used to verify certain properties concerning these machines that were not verifiable before using previous techniques and formulate a subset of Presburger LTL that is decidable for satisfiability-checking with respect to these machines.
Abstract: A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a 2-tape pushdown acceptor with reversal-bounded counters. We improve this result by showing that the stack can be removed from the acceptor, i.e., the binary reachability can be accepted by a 2-tape finite-state acceptor with reversal-bounded counters.We also obtain similar results for more general machine models. Our characterizations can be used to verify certain properties concerning these machines that were not verifiable before using previous techniques. We are also able to formulate a subset of Presburger LTL that is decidable for satisfiability-checking with respect to these machines.

6 citations

Journal ArticleDOI
TL;DR: The presented proof for bisimulation equivalence of first-order grammars is an alternative proof for a result by Senizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata.

6 citations

Journal ArticleDOI
TL;DR: It is shown that 1-NSPACE[t(n)] is characterized in terms of splicing systems: it is the class of languages accepted by a t(n)-space uniform family of extendedsplicing systems having production time O(t( n)) with the additional property that each finite automaton appearing in the family of splice systems has at most a constant number of states.

6 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
87% related
Finite-state machine
15.1K papers, 292.9K citations
86% related
Model checking
16.9K papers, 451.6K citations
84% related
Concurrency
13K papers, 347.1K citations
84% related
String (computer science)
19.4K papers, 333.2K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202314
202234
202129
202052
201947
201834