Parallel recognition and ranking of context-free languages (Q5096817): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel generation of a computation tree form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parallel recognition of unambiguous context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for Speedup in Parallel Parsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal parallel computations for sequences of brackets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for dynamic expression evaluation and context-free recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems concerningL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of ranking simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed of Recognition of Context-Free Languages by Array Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguity of circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3357533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast recognition of deterministic cfl's with a smaller number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel tree-contraction and Fibonacci numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel parsing of bracket languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the recognition of parallel 2D-image languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of parallel parsing of general context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel time O(log n) recognition of unambiguous context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient parallel computations of costs of paths on a grid graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient parallel computations for some dynamic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel parsing on the connection machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel parsing of programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133131 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-55808-x_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1541386091 / rank
 
Normal rank

Latest revision as of 11:20, 30 July 2024

scientific article; zbMATH DE number 7573121
Language Label Description Also known as
English
Parallel recognition and ranking of context-free languages
scientific article; zbMATH DE number 7573121

    Statements

    Parallel recognition and ranking of context-free languages (English)
    0 references
    18 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references