63 search results - page 6 / 13 » Minimizing NFA's and Regular Expressions |
WIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
ICDE
2011
IEEE
13 years 8 days ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
DBPL
2005
Springer
14 years 2 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
SIAMIS
2008
13 years 8 months ago
2008
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
HYBRID
1998
Springer
14 years 24 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...