On finite and polynomial ambiguity of weighted tree automata (Q2817402)
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 6620610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finite and polynomial ambiguity of weighted tree automata |
scientific article; zbMATH DE number 6620610 |
Statements
On Finite and Polynomial Ambiguity of Weighted Tree Automata (English)
0 references
30 August 2016
0 references
weighted tree automata
0 references
quantitative tree automata
0 references
finite ambiguity
0 references
polynomial ambiguity
0 references
weighted logics
0 references
0 references
0 references
0.8436546921730042
0 references
0.8323959708213806
0 references
0.8239385485649109
0 references
0.8025856614112854
0 references
