110 search results - page 3 / 22 » Mean-Payoff Automaton Expressions |
119
click to vote
FSTTCS
2008
Springer
15 years 5 months 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...
WIA
2005
Springer
15 years 9 months ago
2005
Springer
117
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expr...
163
click to vote
JUCS
2010
15 years 2 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
158
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....