Logics and Automata for Totally Ordered Trees
From MaRDI portal
(Redirected from Publication:3522020)
Recommendations
- Term Rewriting and Applications
- An automata model for trees with ordered data values
- Complete axiomatizations of fragments of monadic second-order logic on finite trees
- Extending two-variable logic on data trees with order on data values and its automata
- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
Cites work
- Algebraic automata and context-free sets
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 1665452 (Why is no real title available?)
- scientific article; zbMATH DE number 475416 (Why is no real title available?)
- Monadic Datalog and the expressive power of languages for web information extraction
- Rewriting Techniques and Applications
Cited in
(8)- Logics for Unordered Trees with Data Constraints on Siblings
- Characterization of Logics over Ranked Tree Languages
- PDL for ordered trees
- First-order logic on finite trees
- An Automata Theoretic Approach to Rational Tree Relations
- Hybrid tree automata and the yield theorem for constituent tree automata
- Sweeping permutation automata
- Constituency parsing as an instance of the M-monoid parsing problem
This page was built for publication: Logics and Automata for Totally Ordered Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522020)
