Computing the width of non-deterministic automata (Q5207047)
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: Computing the width of non-deterministic automata |
scientific article; zbMATH DE number 7147439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the width of non-deterministic automata |
scientific article; zbMATH DE number 7147439 |
Statements
3 January 2020
0 references
finite automaton
0 references
automaton width
0 references
good-for-games automaton
0 references
determinisation
0 references
0 references
0.9724271893501282
0 references
0.7847818732261658
0 references
0.778762698173523
0 references
0.7670590877532959
0 references
0.7576829195022583
0 references
