Sciweavers

7 search results - page 1 / 2
» Operator Precedence and the Visibly Pushdown Property
Sort
View
LATA
2010
Springer
13 years 12 months ago
Operator Precedence and the Visibly Pushdown Property
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...
Stefano Crespi-Reghizzi, Dino Mandrioli
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 2 months ago
Precedence Automata and Languages
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...
Violetta Lonati, Dino Mandrioli, Matteo Pradella
MFCS
2010
Springer
13 years 3 months ago
Properties of Visibly Pushdown Transducers
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
Emmanuel Filiot, Jean-François Raskin, Pier...
DLT
2007
13 years 6 months ago
2-Visibly Pushdown Automata
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
Dario Carotenuto, Aniello Murano, Adriano Peron
WWW
2007
ACM
14 years 6 months ago
Visibly pushdown automata for streaming XML
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan