2 search results - page 1 / 1 » Beyond Regularity: Equational Tree Automata for Associative ... |
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...
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...