Sciweavers

204 search results - page 1 / 41
» The Language, the Expression, and the (Small) Automaton
Sort
View
CONCUR
2010
Springer
13 years 6 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
FSTTCS
2008
Springer
13 years 6 months ago
An Optimal Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
Stefan Gulan, Henning Fernau
ISOLA
2004
Springer
13 years 10 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
BIRTHDAY
1999
Springer
13 years 9 months ago
Thompson Languages
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
Dora Giammarresi, Jean-Luc Ponty, Derick Wood