Complexity of bifix-free regular languages (Q5920053)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6763315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of bifix-free regular languages |
scientific article; zbMATH DE number 6763315 |
Statements
Complexity of bifix-free regular languages (English)
0 references
22 August 2017
0 references
bifix-free
0 references
most complex
0 references
prefix-free
0 references
state complexity
0 references
suffix-free
0 references
transition semigroup
0 references
0.9998721480369568
0 references
0.8844029307365417
0 references
0.8797886371612549
0 references
0.8765361309051514
0 references
0.8719198107719421
0 references
