371 search results - page 9 / 75 » Pushdown Automata Simulator |
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
114
click to vote
CSR
2007
Springer
15 years 5 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
104
Voted
FCT
2009
Springer
15 years 3 months ago
2009
Springer
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
114
click to vote
CONCUR
1997
Springer
15 years 3 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...