Regular tree languages definable in FO
From MaRDI portal
Recommendations
Cited in
(27)- Algebraic recognizability of regular tree languages
- Characterizing EF and EX tree logics
- Regular tree languages, cardinality predicates, and addition-invariant FO
- Regular languages of thin trees
- Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
- Regularity equals monadic second-order definability for quasi-trees
- First-order definable languages
- Algebra for Infinite Forests with an Application to the Temporal Logic EF
- Deciding definability in \(\mathrm{FO}^2(<_{\mathbf{v}},<_{\mathbf{h}})\) on trees
- scientific article; zbMATH DE number 3888931 (Why is no real title available?)
- A decidable characterization of locally testable tree languages
- On computing the measures of first-order definable sets of trees
- Characterization of Logics over Ranked Tree Languages
- Algebraic characterization of logically defined tree languages
- On the expressive power of FO[+]
- Games for Temporal Logics on Trees
- Forest Expressions
- A Decidable Characterization of Locally Testable Tree Languages
- scientific article; zbMATH DE number 4110130 (Why is no real title available?)
- Aural pattern recognition experiments and the subregular hierarchy
- Theoretical Aspects of Computing – ICTAC 2005
- Weak separation problem for tree languages
- Parsing unranked tree languages, folded once
- Regular sets over extended tree structures
- Axiomatizing the equational theory of regular tree languages
- A note on the characterization of TL [EF]
- Automata for XML -- a survey
This page was built for publication: Regular tree languages definable in FO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710686)
