Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity |
scientific article |
Statements
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (English)
0 references
8 April 2016
0 references
descriptional complexity
0 references
subword closure
0 references
NFA equivalence
0 references
language approximation
0 references
