Comparing the succinctness of monadic query languages over finite trees (Q4659888): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:09, 7 February 2024
scientific article; zbMATH DE number 2148225
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing the succinctness of monadic query languages over finite trees |
scientific article; zbMATH DE number 2148225 |
Statements
Comparing the succinctness of monadic query languages over finite trees (English)
0 references
21 March 2005
0 references
monadic second-order logic
0 references
monadic least fixed point logic
0 references
full modal mu-calculus
0 references
stratified monadic datalog
0 references
monadic datalog
0 references
finite automata on labelled finite trees
0 references
