Unrestricted state complexity of binary operations on regular languages (Q2829970)
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: Unrestricted state complexity of binary operations on regular languages |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrestricted state complexity of binary operations on regular languages |
scientific article |
Statements
Unrestricted State Complexity of Binary Operations on Regular Languages (English)
0 references
9 November 2016
0 references
Boolean operation
0 references
concatenation
0 references
different alphabets
0 references
most complex languages
0 references
product
0 references
quotient complexity
0 references
regular language
0 references
state complexity
0 references
stream
0 references
unrestricted complexity
0 references
0.8730959296226501
0 references
0.8268817067146301
0 references
0.8169360756874084
0 references
0.8130910396575928
0 references
