7 search results - page 1 / 2 » Alternation in Equational Tree Automata Modulo XOR |
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
CADE
2006
Springer
14 years 5 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
CADE
2006
Springer
13 years 8 months 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...
IANDC
2007
13 years 4 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...