97 search results - page 5 / 20 » Visibly Pushdown Games |
FOIKS
2008
Springer
15 years 1 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
AMAST
2010
Springer
14 years 6 months ago
2010
Springer
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
104
click to vote
IPL
2008
14 years 11 months ago
2008
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...