278 search results - page 13 / 56 » Enumerating Regular Expressions and Their Languages |
WIA
2004
Springer
14 years 24 days 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...
ICS
2010
Tsinghua U.
14 years 8 days ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
WIA
2009
Springer
14 years 2 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
SARA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
AAAI
2007
13 years 9 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...