Operational state complexity of unary NFAs with finite nondeterminism (Q896686)
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 6519459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Operational state complexity of unary NFAs with finite nondeterminism |
scientific article; zbMATH DE number 6519459 |
Statements
Operational state complexity of unary NFAs with finite nondeterminism (English)
0 references
10 December 2015
0 references
finite automata
0 references
limited nondeterminism
0 references
state complexity
0 references
language operations
0 references
unary regular languages
0 references
descriptional complexity
0 references
0 references
0 references
0.9659749269485474
0 references
0.8470532298088074
0 references
0.8413919806480408
0 references
