parallel parsing from recurrence equations (Q4870969): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207169608804462 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998024048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel lexical analysis and parsing on the AMT distributed array processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient all-parses systolic algorithm for general context-free parsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel parsing on a one-way linear array of finite-state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Organization of Computations for Uniform Recurrence Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic parsing of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mapping of linear recurrence equations on regular arrays / rank
 
Normal rank

Latest revision as of 11:22, 24 May 2024

scientific article; zbMATH DE number 861039
Language Label Description Also known as
English
parallel parsing from recurrence equations
scientific article; zbMATH DE number 861039

    Statements