Nondeterministic state complexity for suffix-free regular languages (Q4964025)
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: Nondeterministic state complexity for suffix-free regular languages |
scientific article; zbMATH DE number 7315104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic state complexity for suffix-free regular languages |
scientific article; zbMATH DE number 7315104 |
Statements
24 February 2021
0 references
nondeterministic state complexity
0 references
suffix-free regular languages
0 references
suffix codes
0 references
0.9325377941131592
0 references
0.9291327595710754
0 references
0.9291325211524964
0 references
0.9071834087371826
0 references
0.9004892110824585
0 references
