Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language (Q5250874)
From MaRDI portal
scientific article; zbMATH DE number 6438975
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language |
scientific article; zbMATH DE number 6438975 |
Statements
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language (English)
0 references
22 May 2015
0 references
bifix-free
0 references
factor-free
0 references
finite automaton
0 references
quotient complexity
0 references
regular language
0 references
state complexity
0 references
subword-free
0 references
tight upper bound
0 references
