CADE
2006
Springer
13 years 10 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...
CSL
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
FROCOS
2007
Springer
14 years 1 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:...