Complexity of suffix-free regular languages (Q2947876)
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: Complexity of suffix-free regular languages |
scientific article; zbMATH DE number 6486804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of suffix-free regular languages |
scientific article; zbMATH DE number 6486804 |
Statements
Complexity of Suffix-Free Regular Languages (English)
0 references
29 September 2015
0 references
most complex
0 references
regular language
0 references
state complexity
0 references
suffix-free
0 references
syntactic complexity
0 references
transition semigroup
0 references
0.8893164396286011
0 references
0.8719947934150696
0 references
0.857735812664032
0 references
0.8577355742454529
0 references
0.8388038873672485
0 references
