Automata and logics for unranked and unordered trees

DOI10.1007/978-3-540-32033-3_36MaRDI QIDQ5703872zbMATH OpenOpenAlexFDO

Authors Iovka Boneva, Jean-Marc Talbot

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Weighted logics for unranked tree automata
• Tree automata
• Automata for unordered trees
• Counting in trees
• Logics for unranked trees: An overview

Cited in

(21)

• Alternating two-way AC-tree automata
• Logics for unordered trees with data constraints
• Weighted logics for unranked tree automata
• Complexity of modal logics with Presburger constraints
• Logics for Unordered Trees with Data Constraints on Siblings
• Counting in trees
• Logics and Automata for Totally Ordered Trees
• Graph decompositions and tree automata in reasoning with uncertainty
• scientific article; zbMATH DE number 7315101 (Why is no real title available?)
• scientific article; zbMATH DE number 7362732 (Why is no real title available?)
• Automata for unordered trees
• Logical definability and query languages over ranked and unranked trees
• Logics for Unranked Trees: An Overview
• Tree automata
• Finite Automata on Unranked and Unordered DAGs
• Unranked Tree Automata with Sibling Equalities and Disequalities
• An Automata Theoretic Approach to Rational Tree Relations
• Counting in trees for free
• Logics for unranked trees: An overview
• Presburger Büchi tree automata with applications to logics with expressive counting
• Schemas for unordered XML on a DIME

This page was built for publication: Automata and logics for unranked and unordered trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703872)