Learning regular sets from queries and counterexamples
Information and Computation
An introduction to computational learning theory
An introduction to computational learning theory
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Term rewriting and all that
Journal of the ACM (JACM)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Regular expression types for XML
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Set-Based Analysis for Logic Programming and Tree Automata
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Theoretical Computer Science - Foundations of software science and computation structures
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
A static analysis using tree automata for XML access control
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Languages Modulo Normalization
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
The maude formal tool environment
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On the completeness of context-sensitive order-sorted specifications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
| Hi-index | 0.00 |
In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a sufficient completeness checker for specifications with rewriting modulo an equational theory. Propositional tree automata recognize regular equational tree languages. However, unlike regular equational tree automata, the class of propositional tree automata is closed under Boolean operations. This extra expressiveness does not affect the decidability of the membership problem. This paper also analyzes in detail the emptiness problem for propositional tree automata with associative theories. Though undecidable in general, we present a semi-algorithm for checking emptiness based on machine learning that we have found useful in practice.