Most Complex Non-Returning Regular Languages (Q5205037)
From MaRDI portal
scientific article; zbMATH DE number 7141918
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Most Complex Non-Returning Regular Languages |
scientific article; zbMATH DE number 7141918 |
Statements
Most Complex Non-Returning Regular Languages (English)
0 references
10 December 2019
0 references
atom
0 references
Boolean operation
0 references
concatenation
0 references
different alphabets
0 references
most complex
0 references
reversal
0 references
regular language
0 references
star
0 references
state complexity
0 references
syntactic semigroup
0 references
transition semigroup
0 references
unrestricted complexity
0 references
