Automata and logics for unranked and unordered trees

Authors:
Iovka Boneva;Jean-Marc Talbot
Affiliations:
Laboratoire d'Informatique Fondamentale de Lille, UMR CNRS/USTL 8022, INRIA Futurs – MOSTRARE Project;Laboratoire d'Informatique Fondamentale de Lille, UMR CNRS/USTL 8022, INRIA Futurs – MOSTRARE Project
Venue:
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Year:
2005

Citing 15
Cited 4

The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
On aperiodic trace languages

STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
The monadic second order logic of graphs VI: on several representations of graphs by relational structures

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Basic notions of universal algebra for language theory and graph grammars

Theoretical Computer Science
On Context-Free Languages

Journal of the ACM (JACM)
Petri net languages and infinite subsets of Nm

Journal of Computer and System Sciences
Query automata over finite trees

Theoretical 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
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
Numerical document queries

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A logic you can count on

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
XML schema, tree logic and sheaves automata

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Monadic second-order logics with cardinalities

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Alternating two-way AC-tree automata

Information and Computation
Finite automata on unranked and unordered DAGs

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Monotone AC-Tree automata

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Presburger modal logic is PSPACE-Complete

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unordered trees. We survey classes of tree automata introduced for the logics PMSO and CMSO as well as other related formalisms; we gather results from the literature and sometimes clarify or fill the remaining gaps between those various formalisms. Finally, we complete our study by adapting these classes of automata for capturing precisely the expressiveness of the logic MSO.