The effective entropies of some extensions of context-free languages (Q751289): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective entropies and data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the membership problem for some extensions of context-free languagest† / rank
 
Normal rank

Revision as of 12:48, 21 June 2024

scientific article
Language Label Description Also known as
English
The effective entropies of some extensions of context-free languages
scientific article

    Statements

    The effective entropies of some extensions of context-free languages (English)
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    ambiguity
    0 references
    formal languages
    0 references
    polynomial time
    0 references
    EDOL language
    0 references
    simple matrix language
    0 references
    entropy
    0 references