STACS 2005
From MaRDI portal
Publication:5710686
DOI10.1007/B106485zbMATH Open1118.03314OpenAlexW4230940848MaRDI QIDQ5710686FDOQ5710686
Authors: Michael Benedikt, Luc Segoufin 
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Recommendations
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
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
- Regular tree languages, cardinality predicates, and addition-invariant FO
- A note on the characterization of TL [EF]
- 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
- Forest Expressions
- Characterizing EF and EX tree logics
- Algebraic recognizability of regular tree languages
- Title not available (Why is that?)
- Games for Temporal Logics on Trees
- Title not available (Why is that?)
- 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)
