Quotient complexity of star-free languages (Q5740417)
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 6606348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quotient complexity of star-free languages |
scientific article; zbMATH DE number 6606348 |
Statements
26 July 2016
0 references
aperiodic automaton
0 references
quotient complexity
0 references
regular languages
0 references
star-free languages
0 references
state complexity
0 references
0.9980245232582092
0 references
0.891706109046936
0 references
0.8688749670982361
0 references
0.8674413561820984
0 references
0.8489556908607483
0 references
