Rational transductions and complexity of counting problems (Q4850332): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the number of strings of given length in context-free languages / 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: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic models and ambiguity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression and Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of ranking simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective entropies and data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homomorphism theorem for weighted context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01185866 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991924048 / rank
 
Normal rank

Latest revision as of 08:22, 30 July 2024

scientific article; zbMATH DE number 803774
Language Label Description Also known as
English
Rational transductions and complexity of counting problems
scientific article; zbMATH DE number 803774

    Statements

    Rational transductions and complexity of counting problems (English)
    0 references
    0 references
    0 references
    14 November 1995
    0 references
    rational transductions
    0 references
    counting problems
    0 references
    \(Z\)-algebraic languages
    0 references

    Identifiers