371 search results - page 16 / 75 » Pushdown Automata Simulator |
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
132
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
103
Voted
FOIKS
2008
Springer
15 years 3 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 ...
104
click to vote
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
84
Voted
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...