Sciweavers

2409 search results - page 5 / 482
» On Extended Regular Expressions
Sort
View
WIA
2009
Springer
15 years 4 months ago
Short Regular Expressions from Finite Automata: Empirical Results
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 ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
GCB
2000
Springer
75views Biometrics» more  GCB 2000»
15 years 1 months ago
Regexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
Pierre Nicodème
SARA
2005
Springer
15 years 3 months ago
Learning Regular Expressions from Noisy Sequences
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...
Ugo Galassi, Attilio Giordana
78
Voted
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
Marc Boule, Zeljko Zilic
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
14 years 1 months ago
Adding regular expressions to graph reachability and pattern queries
—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 ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...