Decidable classes of tree automata mixing local and global constraints modulo flat theories (Q4927423)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6177461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidable classes of tree automata mixing local and global constraints modulo flat theories |
scientific article; zbMATH DE number 6177461 |
Statements
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories (English)
0 references
20 June 2013
0 references
tree automata
0 references
tree languages
0 references
XML processing
0 references
symbolic constraints
0 references
decidability
0 references
monadic second-order logic
0 references
0.8689679503440857
0 references
0.8637527823448181
0 references
0.8275552988052368
0 references
0.8271565437316895
0 references
0.8169957399368286
0 references
