Towards a theory of complexity of regular languages (Q5376331)
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 6938210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a theory of complexity of regular languages |
scientific article; zbMATH DE number 6938210 |
Statements
17 September 2018
0 references
atom
0 references
Boolean operation
0 references
complexity measure
0 references
concatenation
0 references
convex language
0 references
most complex language
0 references
quotient complexity
0 references
regular language
0 references
reversal
0 references
star
0 references
state complexity
0 references
syntactic semigroup
0 references
unrestricted complexity
0 references
0.8768289685249329
0 references
0.8685875535011292
0 references
0.856566309928894
0 references
0.8516103029251099
0 references
0.8510812520980835
0 references
