205 search results - page 8 / 41 » Testing the Equivalence of Regular Languages |
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
183
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
APIN
2000
14 years 9 months ago
2000
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
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 desc...
ICALP
2005
Springer
15 years 2 months ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...