Sciweavers

113 search results - page 3 / 23
» Height-Deterministic Pushdown Automata
Sort
View
74
Voted
SOFSEM
2009
Springer
15 years 6 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»
14 years 9 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
73
Voted
JAPLL
2008
95views more  JAPLL 2008»
14 years 9 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
78
Voted
CAV
2000
Springer
141views Hardware» more  CAV 2000»
15 years 1 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
14 years 10 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