39 search results - page 1 / 8 » Past Pushdown Timed Automata |
71
Voted
WIA
2001
Springer
15 years 1 months ago
2001
Springer
d Abstract) Zhe Dang , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
105
click to vote
COCO
2010
Springer
15 years 1 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...
78
Voted
CAV
2000
Springer
15 years 1 months ago
2000
Springer
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...
74
Voted
SOFSEM
2009
Springer
15 years 6 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-...
87
Voted
LATA
2009
Springer
15 years 4 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...