Results 1  10
of
207
A Basic Parallel Process as a Parallel Pushdown Automaton
"... We investigate the set of basic parallel processes, recursively defined by action prefix, interleaving, 0 and 1. Different from literature, we use the constants 0 and 1 standing for unsuccessful and successful termination in order to stay closer to the analogies in automata theory. We prove that any ..."
Abstract
 Add to MetaCart
that any basic parallel process is rooted branching bisimulation equivalent to a regular process communicating with a bag (also called a parallel pushdown automaton) and therefore we can regard the bag as the prototypical basic parallel process. This result is closely related to the fact that any context
The Neural Network Pushdown Automaton: Model, Stack and Learning Simulations
, 1993
"... In order for neural networks to learn complex languages or grammars, they must have sufficient computational power or resources to recognize or generate such languages. Though many approaches to effectively utilizing the computational power of neural networks have been discussed, an obvious one is t ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
is to couple a recurrent neural network with an external stack memory in effect creating a neural network pushdown automata (NNPDA). This NNPDA generalizes the concept of a recurrent network so that the network becomes a more complex computing structure. This paper discusses in detail a NNPDA its
Two Algorithms for Finding k Shortest Paths of a Weighted Pushdown Automaton
, 2014
"... Weighted pushdown automata (WPDAs) have recently been adopted in some applications such as machine translation [Iglesias et al., 2011] as a more compact alternative to weighted finitestate automata (WFSAs) for representing a weighted set of strings. Allauzen and Riley [2012] introduce a set of basi ..."
Abstract
 Add to MetaCart
Weighted pushdown automata (WPDAs) have recently been adopted in some applications such as machine translation [Iglesias et al., 2011] as a more compact alternative to weighted finitestate automata (WFSAs) for representing a weighted set of strings. Allauzen and Riley [2012] introduce a set
three sentence processing models: Joshi’s Embedded Pushdown Automaton
"... Data from Hindi centerembedding constructions (CECs) are used to evaluate ..."
Abstract
 Add to MetaCart
Data from Hindi centerembedding constructions (CECs) are used to evaluate
Pushdown Automata Simulator
, 2009
"... Pushdown automata are widely used to characterize the class of contextfree languages. A pushdown automaton is a finite automaton that is equipped with a stack which can record a potentially unbounded amount of information. The aim of this project is to develop a simulator which visualizes the beha ..."
Abstract
 Add to MetaCart
Pushdown automata are widely used to characterize the class of contextfree languages. A pushdown automaton is a finite automaton that is equipped with a stack which can record a potentially unbounded amount of information. The aim of this project is to develop a simulator which visualizes
Synchronization of pushdown automata
 In Proc. 10th Developments in Language Theory Conference, LNCS 4036
, 2006
"... Abstract. We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are −1,0, 1. For each transducer, we can decide whether ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are −1,0, 1. For each transducer, we can decide whether
Symmetry Coincides with Nondeterminism for TimeBounded Auxiliary Pushdown Automata
"... We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC¹ = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC¹ = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time.
Model checking CTL Properties of Pushdown Systems
 In FSTTCS’00, LNCS 1974
, 2000
"... A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula # # L decide if # holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its fra ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula # # L decide if # holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its
Trimming Visibly Pushdown Automata
"... Abstract We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only wellnested words, returns an equivalent visibly pushdown automaton that is trimmed. We then show how this procedure c ..."
Abstract
 Add to MetaCart
Abstract We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only wellnested words, returns an equivalent visibly pushdown automaton that is trimmed. We then show how this procedure
HigherOrder Pushdown Trees Are Easy
, 2002
"... We show that the monadic secondorder theory of an infinite tree recognized by a higherorder pushdown automaton of any level is decidable. We also show that trees recognized by pushdown automata of level n coincide with trees generated by safe higherorder grammars of level n. Our decidability resu ..."
Abstract

Cited by 63 (4 self)
 Add to MetaCart
We show that the monadic secondorder theory of an infinite tree recognized by a higherorder pushdown automaton of any level is decidable. We also show that trees recognized by pushdown automata of level n coincide with trees generated by safe higherorder grammars of level n. Our decidability
Results 1  10
of
207