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