On the Inclusion Problem for Context-free Real-time Languages

スポンサーリンク

概要

• 論文の詳細を見る

• We introduce the class of event-clock visibly pushdown automata (ECVPAs) by combining the ideas of event-clock automata and visibly pushdown automata. The class of ECVPAs is, on one hand, enough to model simple real-time pushdown systems and, on the other hand, 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) ⊆ L (B) is decidable.

• 一般社団法人情報処理学会の論文
• 2009-03-23

著者

• Mizuhito Ogawa

  Japan Advanced Institute Of Science And Technology

• Mizuhito Ogawa

  Graduate School of Information Science, Japan Advanced Institute of Science and Technology

関連論文

• Stacking-based Context-sensitive Points-to Analysis for Java
• On the Inclusion Problem for Context-free Real-time Languages
• Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata
• Associative Search on Shogi Game Records

スポンサーリンク