Complexity of matching problems
Proc. of the first international conference on Rewriting techniques and applications
Tree automata help one to solve equational formulae in AC-theories
Journal of Symbolic Computation
Term rewriting and all that
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pumping, Cleaning and Symbolic Constraints Solving
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
A Good Class of Tree Automata and Application to Inductive Theorem Proving
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Ground Reducibility and Automata with Disequality Constraints
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Feature Automata and Recognizable Sets of Feature Trees
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Precise bounds for presburger arithmetic and the reals with addition: Preliminary report
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Foundations of software science and computation structures
Alternating two-way AC-tree automata
Information and Computation
On Symbolic Verification of Weakly Extended PAD
Electronic Notes in Theoretical Computer Science (ENTCS)
Two-way equational tree automata for AC-like theories: decidability and closure properties
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
On intersection problems for polynomially generated sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Alternation in equational tree automata modulo XOR
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Unranked tree automata with sibling equalities and disequalities
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Multitree are unranked, unordered trees and occur in many Computer Science applications like rewriting and logic, knowledge representation, XML queries, typing for concurrent systems, cryptographic protocols.... We define constrained multitree automata which accept sets of multitrees where the constraints are expressed in a first-order theory of multisets with counting formulae which is very expressive and decidable. The resulting class of multitree automata is closed under boolean combination, has a decidable emptiness problem and we show that this class strictly embeds all previous classes of similar devices which have been defined for a whole variety of applications.