644 search results - page 1 / 129 » Precedence Automata and Languages |
CORR
2010
Springer
13 years 1 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...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
PLANX
2007
13 years 6 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...