On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the state complexity of closures and interiors of regular languages with subwords and superwords |
scientific article |
Statements
On the state complexity of closures and interiors of regular languages with subwords and superwords (English)
0 references
10 December 2015
0 references
finite automata and regular languages
0 references
subwords and superwords
0 references
state complexity
0 references
combined operations
0 references
closures and interiors of regular languages
0 references
