On the Complexity of Equivalence and Minimisation for Q-weighted Automata (Q4913771)
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: On the Complexity of Equivalence and Minimisation for Q-weighted Automata |
scientific article; zbMATH DE number 6152238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Equivalence and Minimisation for Q-weighted Automata |
scientific article; zbMATH DE number 6152238 |
Statements
On the Complexity of Equivalence and Minimisation for Q-weighted Automata (English)
0 references
9 April 2013
0 references
weighted automata
0 references
equivalence checking
0 references
polynomial identity testing
0 references
minimisation
0 references
0.89128196
0 references
0.8850841
0 references
0.8832835
0 references
0.8832835
0 references
0.87841547
0 references
0.8767204
0 references
0.8754441
0 references
0.8748916
0 references
0.87402153
0 references
