206 search results - page 19 / 42 » Regular Expressions into Finite Automata |
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
CSL
2006
Springer
13 years 7 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
13 years 8 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
RIA
2006
13 years 7 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...