On measuring nondeterminism in regular languages (Q912641)
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 measuring nondeterminism in regular languages |
scientific article; zbMATH DE number 4145355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On measuring nondeterminism in regular languages |
scientific article; zbMATH DE number 4145355 |
Statements
On measuring nondeterminism in regular languages (English)
0 references
1990
0 references
spectrum of a regular language
0 references
upper bounds
0 references
lower bounds
0 references
computability
0 references
nondeterminism
0 references
finite automaton
0 references
0.8214414119720459
0 references
0.8117626309394836
0 references
0.8025631308555603
0 references
0.7918640971183777
0 references
