Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity (Q2799199)
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 6566800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity |
scientific article; zbMATH DE number 6566800 |
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
0 references
0.7716506719589233
0 references
0.7681871056556702
0 references
0.7660807371139526
0 references
0.7639385461807251
0 references
0.7528785467147827
0 references
