State complexity of basic operations on suffix-free regular languages (Q1029324)
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: State complexity of basic operations on suffix-free regular languages |
scientific article; zbMATH DE number 5577367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of basic operations on suffix-free regular languages |
scientific article; zbMATH DE number 5577367 |
Statements
State complexity of basic operations on suffix-free regular languages (English)
0 references
10 July 2009
0 references
state complexity
0 references
suffix-free regular languages
0 references
0.9999988675117492
0 references
0.9474737048149108
0 references
0.9291325211524964
0 references
0.9014670252799988
0 references
0.8944992423057556
0 references
