Characterization of Logics over Ranked Tree Languages
From MaRDI portal
Publication:3540193
DOI10.1007/978-3-540-87531-4_29zbMath1156.03328MaRDI QIDQ3540193
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
03B70: Logic in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic characterization of frontier testable tree languages
- Characterizing EF and EX tree logics
- First-order logic with two variables and unary temporal logic
- Piecewise testable tree languages
- On finite monoids having only trivial subgroups
- STACS 2005
- Tree Languages Defined in First-Order Logic with One Quantifier Alternation