Automata for unordered trees

DOI10.1016/J.IC.2016.07.012MaRDI QIDQ515668zbMATH OpenOpenAlexFDO

Authors Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen

Publication date 16 March 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01179493/file/DeterministicAutomataUnordered_Journal-1.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• scientific article; zbMATH DE number 7362732
• Term Rewriting and Applications
• Unranked Tree Automata with Sibling Equalities and Disequalities
• Counting in trees
• An automata model for trees with ordered data values

Cites work

• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• scientific article; zbMATH DE number 1953124 (Why is no real title available?)
• scientific article; zbMATH DE number 2043533 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1392285 (Why is no real title available?)
• scientific article; zbMATH DE number 7362732 (Why is no real title available?)
• Automata, Languages and Programming
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Chrobak normal form revisited, with applications
• Complexity of problems of commutative grammars
• Counting in trees
• Database Programming Languages
• Feature automata and recognizable sets of feature trees
• Feature-constraint logics for unification grammars
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Integer vector addition systems with states
• Logics for Unordered Trees with Data Constraints on Siblings
• Monadic Datalog and the expressive power of languages for web information extraction
• Multitree automata that count
• On Context-Free Languages
• On the complexity of integer programming
• Records for logic programming
• Rewriting Techniques and Applications
• Semigroups, Presburger formulas, and languages
• Static and dynamic semantics of NoSQL languages
• Term Rewriting and Applications

Cited in

(8)

• Unranked Tree Automata with Sibling Equalities and Disequalities
• scientific article; zbMATH DE number 7362732 (Why is no real title available?)
• Term Rewriting and Applications
• Presburger Büchi tree automata with applications to logics with expressive counting
• Logics for unordered trees with data constraints
• Finite Automata on Unranked and Unordered DAGs
• Automata, Languages and Programming
• scientific article; zbMATH DE number 7315101 (Why is no real title available?)

Describes a project that uses

Uses Software

• XPath

This page was built for publication: Automata for unordered trees

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