124 search results - page 6 / 25 » Antichain Algorithms for Finite Automata |
125
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic ļ¬nite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ļ...
134
Voted
ISOLA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard speciļ¬cation languages such as PSL/Sugar ([2]). The model checking procedure...
127
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
167
Voted
ICC
2011
IEEE
14 years 3 months ago
2011
IEEE
āRegular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
110
Voted
ACL
1998
15 years 5 months ago
1998
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...