371 search results - page 2 / 75 » Pushdown Automata Simulator |
DLT
2006
15 years 1 months ago
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 autom...
123
Voted
COCO
2010
Springer
15 years 3 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
86
Voted
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
93
Voted
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
102
click to vote
IPL
2008
14 years 11 months ago
2008
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...