Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizing weighted MSO for trees by branching transitive closure logics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing weighted MSO for trees by branching transitive closure logics |
scientific article |
Statements
Characterizing weighted MSO for trees by branching transitive closure logics (English)
0 references
24 July 2015
0 references
weighted tree automata
0 references
weighted monadic second-order logic
0 references
transitive closure
0 references
0 references
0 references
0.836544394493103
0 references
0.7978962659835815
0 references
0.795069694519043
0 references
0.7939184308052063
0 references