Unrestricted State Complexity of Binary Operations on Regular Languages (Q2829970)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
