On algorithmic complexity of optimal alphabetical coding problems for context-free languages (Q3970809)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On algorithmic complexity of optimal alphabetical coding problems for context-free languages |
scientific article; zbMATH DE number 8007
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On algorithmic complexity of optimal alphabetical coding problems for context-free languages |
scientific article; zbMATH DE number 8007 |
Statements
25 June 1992
0 references
context-free languages
0 references
deterministic languages
0 references
alphabetical coding
0 references
regular languages
0 references
finite-automaton decoding
0 references
0.841266393661499
0 references