254 search results - page 9 / 51 » Restarting Tree Automata |
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
IANDC
2007
13 years 8 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
ACL
1997
13 years 10 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
CADE
2006
Springer
14 years 15 days ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...