Bounded length UCFG equivalence (Q6487444): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/bfb0009500 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting problems and algebraic formal power series in noncommuting variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of ranking simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel complexity of the regular code problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0009500 / rank
 
Normal rank

Latest revision as of 20:43, 30 December 2024

scientific article; zbMATH DE number 7645888
Language Label Description Also known as
English
Bounded length UCFG equivalence
scientific article; zbMATH DE number 7645888

    Statements

    Identifiers