Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995)
From MaRDI portal
scientific article; zbMATH DE number 6725135
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages |
scientific article; zbMATH DE number 6725135 |
Statements
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (English)
0 references
1 June 2017
0 references
different alphabets
0 references
left ideal
0 references
most complex
0 references
quotient/state complexity
0 references
regular language
0 references
suffix-closed
0 references
suffix-convex
0 references
suffix-free
0 references
syntactic semigroup
0 references
transition semigroup
0 references
unrestricted complexity
0 references
