Most complex deterministic union-free regular languages (Q777986)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Most complex deterministic union-free regular languages |
scientific article |
Statements
Most complex deterministic union-free regular languages (English)
0 references
30 June 2020
0 references
Boolean operation
0 references
different alphabets
0 references
one-cycle-free-path automaton
0 references
regular language
0 references
reversal
0 references
state complexity
0 references
syntactic semigroup
0 references
transition semigroup
0 references
union-free language
0 references
