Nondeterministic complexity in subclasses of convex languages (Q2319915)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nondeterministic complexity in subclasses of convex languages |
scientific article |
Statements
Nondeterministic complexity in subclasses of convex languages (English)
0 references
20 August 2019
0 references
nondeterministic finite automata
0 references
descriptional complexity
0 references
intersection
0 references
union
0 references
concatenation
0 references
Kleene star
0 references
reversal
0 references
complementation
0 references
convex languages
0 references
free languages
0 references
ideal languages
0 references
closed languages
0 references
operational state complexity
0 references
0 references
0 references
0 references
