423 search results - page 10 / 85 » The Generalization of Generalized Automata: Expression Autom... |
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
ICALP
1999
Springer
14 years 1 months ago
1999
Springer
CORR
2009
Springer
13 years 6 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...
DLT
2009
13 years 6 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...