206 search results - page 10 / 42 » Deterministic Caterpillar Expressions |
CONCUR
2010
Springer
13 years 11 months 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...
WAE
2001
13 years 11 months ago
2001
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
FORMATS
2005
Springer
14 years 3 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
ICFP
2006
ACM
14 years 9 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...