Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

CORR
2010
Springer

favoriteEmaildiscussreport

164views Education» more CORR 2010»

Precedence Automata and Languages

13 years 1 months ago

Precedence Automata and Languages

Download homes.dsi.unimi.it

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 well-known visibly pushdown languages, and enjoy the same nice closure properties. We introduce here Floyd automata, an equivalent operational formalism for defining FLs. This also permits to extend the class to deal with infinite strings to perform for instance model checking.

Violetta Lonati, Dino Mandrioli, Matteo Pradella

Real-time Traffic

CORR 2010 | Deterministic Context-free Family | Education | Equivalent Operational Formalism | Nice Closure Properties |

claim paper

Related Content

» Operator Precedence and the Visibly Pushdown Property

» OpenNWA A NestedWord Automaton Library

» TreeWalking Automata Cannot Be Determinized

» XML Transformation Language Based on Monadic Second Order Logic

» Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

» Universality and Language Inclusion for Open and Closed Timed Automata

» Positive Grammar Checking A Finite State Approach

» The Generalization of Generalized Automata Expression Automata

» Languages Modulo Normalization

Post Info
More Details (n/a)

Added	22 Mar 2011
Updated	22 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Violetta Lonati, Dino Mandrioli, Matteo Pradella

Comments (0)