Pages that link to "Item:Q4069798"

The following pages link to Speed of Recognition of Context-Free Languages by Array Automata (Q4069798):

Displaying 19 items.

• Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
• An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
• Systolic parsing of context-free languages (Q756431) (← links)
• Parallel \(LL\) parsing (Q878376) (← links)
• Optimal tradeoffs for addition on systolic arrays (Q916387) (← links)
• On the relationship between propagating context-dependent Lindenmayer systems and cellular automata systems (Q1052823) (← links)
• Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
• Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture (Q1084875) (← links)
• Two-dimensional iterative arrays: Characterizations and applications (Q1102749) (← links)
• Optimal simulation of tree arrays by linear arrays (Q1120283) (← links)
• Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
• Iterative arrays with direct central control (Q1230610) (← links)
• An optimal sublinear time parallel algorithm for some dynamic programming problems (Q1336746) (← links)
• A parallel parsing algorithm for arbitrary context-free grammars (Q1350210) (← links)
• A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
• INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS (Q3022008) (← links)
• Iterative tree arrays with logarithmic depth^† (Q3802619) (← links)
• Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition (Q5096776) (← links)
• Parallel recognition and ranking of context-free languages (Q5096817) (← links)