Comparing the succinctness of monadic query languages over finite trees (Q4659888): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 17:49, 5 March 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
