206 search results - page 11 / 42 » Regular Expressions into Finite Automata |
LICS
2010
IEEE
13 years 6 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...
HYBRID
1998
Springer
14 years 20 days ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
AAAI
2007
13 years 10 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
FSTTCS
1994
Springer
14 years 16 days ago
1994
Springer
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...