Complexity of bifix-free regular languages (Q5919577)
From MaRDI portal
scientific article; zbMATH DE number 7096565
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of bifix-free regular languages |
scientific article; zbMATH DE number 7096565 |
Statements
Complexity of bifix-free regular languages (English)
0 references
20 August 2019
0 references
atom complexity
0 references
bifix-free
0 references
Boolean operations
0 references
magic number
0 references
most complex
0 references
prefix-free
0 references
product
0 references
quotient complexity
0 references
regular language
0 references
reversal
0 references
state complexity
0 references
suffix-free
0 references
syntactic complexity
0 references
transition semigroup
0 references
