415 search results - page 4 / 83 » Regular Processes and Timed Automata |
141
Voted
FOIKS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
70
Voted
FUIN
2002
15 years 1 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
102
Voted
CORR
2009
Springer
14 years 11 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
96
Voted
FMSD
2007
15 years 1 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
126
Voted
ANCS
2007
ACM
15 years 5 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...