Characterization of Logics over Ranked Tree Languages
From MaRDI portal
Publication:3540193
DOI10.1007/978-3-540-87531-4_29zbMATH Open1156.03328OpenAlexW1602811654MaRDI QIDQ3540193FDOQ3540193
Authors: Thomas Place 
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_29
Recommendations
- Logical definability and query languages over ranked and unranked trees
- Algebraic characterization of logically defined tree languages
- Logics for Unranked Trees: An Overview
- Automata, Languages and Programming
- scientific article; zbMATH DE number 3888931
- CONCUR 2004 - Concurrency Theory
- Characterizing EF and EX tree logics
- Logics and Automata for Totally Ordered Trees
- Analysis of logic programs using regular tree languages (extended abstract)
- Characterizing CTL-like logics on finite trees.
Cites Work
- Characterizing EF and EX tree logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- STACS 2005
- Title not available (Why is that?)
- First-order logic with two variables and unary temporal logic
- Piecewise testable tree languages
- An algebraic characterization of frontier testable tree languages
Cited In (8)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- CONCUR 2004 - Concurrency Theory
- Logical definability and query languages over ranked and unranked trees
- Title not available (Why is that?)
- Characterizing EF and EX tree logics
- A syntactic characterization of bounded-rank decision trees in terms of decision lists
- Algebra for trees
- Wreath products of forest algebras, with applications to tree logics
This page was built for publication: Characterization of Logics over Ranked Tree Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540193)
