8 search results - page 1 / 2 » Optimal Regular Tree Pattern Matching Using Pushdown Automat... |
FSTTCS
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
DBPL
2005
Springer
15 years 3 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
85
Voted
VLSISP
2008
14 years 9 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
97
Voted
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...