Sciweavers

113 search results - page 3 / 23
» Height-Deterministic Pushdown Automata
Sort
View
SOFSEM
2009
Springer
14 years 4 months ago
Event-Clock Visibly Pushdown Automata
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-...
Nguyen Van Tang, Mizuhito Ogawa
IPL
2008
147views more  IPL 2008»
13 years 7 months ago
Streaming tree automata
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...
Olivier Gauwin, Joachim Niehren, Yves Roos
JAPLL
2008
95views more  JAPLL 2008»
13 years 7 months ago
A note on an extension of PDL
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
Stefan Göller, Dirk Nowotka
CAV
2000
Springer
141views Hardware» more  CAV 2000»
13 years 11 months ago
Binary Reachability Analysis of Discrete Pushdown Timed Automata
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard ...
ACL
1989
13 years 8 months ago
How to Cover a Grammar
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-determin...
René Leermakers