Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages (Q5350145)
From MaRDI portal
scientific article; zbMATH DE number 6766082
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages |
scientific article; zbMATH DE number 6766082 |
Statements
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages (English)
0 references
25 August 2017
0 references
atoms
0 references
complexity of operations
0 references
prefix-closed
0 references
prefix-convex
0 references
prefix-free
0 references
quotient complexity
0 references
regular languages
0 references
right ideals
0 references
state complexity
0 references
syntactic semigroup
0 references
unrestricted alphabets
0 references
