An automata model for trees with ordered data values

DOI10.1109/LICS.2012.69MaRDI QIDQ2986837zbMATH OpenFDO

Authors Tony Tan

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/LICS.2012.69

zbMATH Keywords

automatadata unranked treesordered data valuestwo-variable logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Data structures (68P05) Formal languages and automata (68Q45)

Recommendations

• Extending two-variable logic on data trees with order on data values and its automata
• scientific article; zbMATH DE number 5999538
• Bottom-up automata on data trees and vertical \(\mathsf{XPath}\)
• Bounded Depth Data Trees
• \(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems

Cited in

(10)

• Logics for unordered trees with data constraints
• \(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems
• Automata based verification over linearly ordered data domains
• Logics and Automata for Totally Ordered Trees
• Forward and backward application of symbolic tree transducers
• Solving Infinite Games in the Baire Space
• Automata for unordered trees
• Extending two-variable logic on data trees with order on data values and its automata
• Bounded Depth Data Trees
• \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)

This page was built for publication: An automata model for trees with ordered data values

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