110 search results - page 10 / 22 » Mean-Payoff Automaton Expressions |
ICDM
2008
IEEE
14 years 3 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,...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
ATVA
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
WIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...