an:05502018
Zbl 1206.68183
Van Tang, Nguyen; Ogawa, Mizuhito
Event-clock visibly pushdown automata
EN
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, ??pindler??v Ml??n, Czech Republic, January 24--30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 558-569 (2009).
2009
a
68Q45
Summary: 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-time pushdown systems and, on the other hand, is determinizable and closed under Boolean operations. We also show that for a timed visibly pushdown automaton \(A\) and an ECVPA \(B\), the inclusion problem \(L(A) \subseteq L(B)\) is decidable.
For the entire collection see [Zbl 1154.68020].