58 search results - page 2 / 12 » An Optimal Construction of Finite Automata from Regular Expr... |
ISOLA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
PAAMS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
DLT
2008
13 years 6 months ago
2008
