Most complex non-returning regular languages (Q2400992)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Most complex non-returning regular languages |
scientific article |
Statements
Most complex non-returning regular languages (English)
0 references
31 August 2017
0 references
atom
0 references
Boolean operation
0 references
concatenation
0 references
different alphabets
0 references
non-returning
0 references
reversal
0 references
star
0 references
state complexity
0 references
syntactic semigroup
0 references
transition semigroup
0 references
unrestricted complexity
0 references
