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
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
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
The AVISS Security Protocol Analysis Tool
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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
Formal and natural computing
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Counting and equality constraints for multitree automata
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
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
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We consider several questions about monotone AC-tree automata, a class of equational tree automata whose transition rules correspond to rules in Kuroda normal form of context-sensitive grammars. Whereas it has been proved that this class has a decision procedure to determine if, given a monotone AC-tree automaton, it accepts no terms, other important decidability or complexity results have not been well-investigated yet. In the paper, we prove that the membership problem for monotone AC-tree automata is PSPACE-complete. We then study the expressiveness of monotone AC-tree automata: precisely, we prove that the family of AC-regular tree languages is strictly subsumed in that of AC-monotone tree languages. The proof technique used in obtaining the above result yields the answers to two different questions, specifically that the family of monotone AC-tree languages is not closed under complementation, and that the inclusion problem for monotone AC-tree automata is undecidable.