223 search results - page 3 / 45 » Construction of Tree Automata from Regular Expressions |
IMSCCS
2006
IEEE
14 years 6 days ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
DLT
2010
13 years 7 months ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
LICS
2005
IEEE
13 years 11 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
JACM
2002
13 years 5 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...