Sciweavers

644 search results - page 22 / 129
» Precedence Automata and Languages
Sort
View
TIME
2002
IEEE
14 years 2 months ago
A Finite-State Approach to Event Semantics
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
Tim Fernando
CSL
2004
Springer
13 years 9 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
CSL
2008
Springer
13 years 11 months ago
An Infinite Automaton Characterization of Double Exponential Time
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
ACL
2009
13 years 7 months ago
Modeling Morphologically Rich Languages Using Split Words and Unstructured Dependencies
We experiment with splitting words into their stem and suffix components for modeling morphologically rich languages. We show that using a morphological analyzer and disambiguator...
Deniz Yuret, Ergun Biçici
FOSSACS
2004
Springer
14 years 3 months ago
On Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
Oded Maler, Amir Pnueli