Quotient complexity of bifix-, factor-, and subword-free regular languages (Q5250874)
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: Quotient complexity of bifix-, factor-, and subword-free regular languages |
scientific article; zbMATH DE number 6438975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quotient complexity of bifix-, factor-, and subword-free regular languages |
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
0.985312283039093
0 references
0.8719198107719421
0 references
0.871587336063385
0 references
0.8678563237190247
0 references
0.8674413561820984
0 references
