Nondeterministic complexity in subclasses of convex languages (Q2319915)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7096569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic complexity in subclasses of convex languages |
scientific article; zbMATH DE number 7096569 |
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
0.94291806
0 references
0 references
0.91576296
0 references
0.8936222
0 references
0.89077216
0 references
0.8864345
0 references
0.88502884
0 references
0.8837316
0 references
0.8815997
0 references
0.8797524
0 references
