Lower bound for converting an NFA with finite nondeterminism into an MDFA (Q5507074)
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 6665226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bound for converting an NFA with finite nondeterminism into an MDFA |
scientific article; zbMATH DE number 6665226 |
Statements
16 December 2016
0 references
finite automata
0 references
limited nondeterminism
0 references
deterministic automata with multiple initial states
0 references
state complexity
0 references
0.9485904574394226
0 references
0.7767699360847473
0 references
0.7756118178367615
0 references
0.7723621129989624
0 references
