204 search results - page 1 / 41 » The Language, the Expression, and the (Small) Automaton |
57
Voted
WIA
2005
Springer
15 years 4 months ago
2005
Springer
CONCUR
2010
Springer
15 years 1 days ago
2010
Springer
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...
FSTTCS
2008
Springer
15 years 3 hour ago
2008
Springer
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...
83
Voted
ISOLA
2004
Springer
15 years 4 months ago
2004
Springer
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...
70
Voted
BIRTHDAY
1999
Springer
15 years 3 months ago
1999
Springer
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...