Complexity of bifix-free regular languages (Q5920053)
From MaRDI portal
scientific article; zbMATH DE number 6763315
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
