Tight bounds for cut-operations on deterministic finite automata (Q4601149)
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: Tight bounds for cut-operations on deterministic finite automata |
scientific article; zbMATH DE number 6827731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for cut-operations on deterministic finite automata |
scientific article; zbMATH DE number 6827731 |
Statements
Tight Bounds for Cut-Operations on Deterministic Finite Automata* (English)
0 references
19 January 2018
0 references
finite automata
0 references
regular language
0 references
cut operation
0 references
iterated cut
0 references
descriptional complexity
0 references
0.9961203932762146
0 references
0.8464540839195251
0 references
0.8020006418228149
0 references
0.8017601370811462
0 references
