Minimising deterministic Büchi automata precisely using SAT solving (Q4930600)
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: Minimising deterministic Büchi automata precisely using SAT solving |
scientific article; zbMATH DE number 5793467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimising deterministic Büchi automata precisely using SAT solving |
scientific article; zbMATH DE number 5793467 |
Statements
Minimising Deterministic Büchi Automata Precisely Using SAT Solving (English)
0 references
29 September 2010
0 references
0.8483337759971619
0 references
0.8409125804901123
0 references
0.8264469504356384
0 references
0.8019152879714966
0 references
0.7964622378349304
0 references
