On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684)
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 6519458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the state complexity of closures and interiors of regular languages with subwords and superwords |
scientific article; zbMATH DE number 6519458 |
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
0 references
0 references
0 references
0.9320389032363892
0 references
0.79560786485672
0 references
0.7935259342193604
0 references
