State Complexity of Basic Operations on Suffix-Free Regular Languages (Q3525596)
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 5344683
| 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 5344683 |
Statements
State Complexity of Basic Operations on Suffix-Free Regular Languages (English)
0 references
17 September 2008
0 references
0.9999988675117492
0 references
0.9474734663963318
0 references
0.9014670252799988
0 references
0.8944990634918213
0 references
