Characterization of Logics over Ranked Tree Languages
From MaRDI portal
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
- An algebraic characterization of frontier testable tree languages
- Characterizing EF and EX tree logics
- First-order logic with two variables and unary temporal logic
- scientific article; zbMATH DE number 5872386 (Why is no real title available?)
- scientific article; zbMATH DE number 1775408 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On finite monoids having only trivial subgroups
- Piecewise testable tree languages
- STACS 2005
Cited in
(8)- Algebra for trees
- Characterizing EF and EX tree logics
- Wreath products of forest algebras, with applications to tree logics
- A syntactic characterization of bounded-rank decision trees in terms of decision lists
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 7104937 (Why is no real title available?)
- Logical definability and query languages over ranked and unranked trees
- CONCUR 2004 - Concurrency Theory
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)
