Speed of Recognition of Context-Free Languages by Array Automata
From MaRDI portal
Publication:4069798
DOI10.1137/0204028zbMATH Open0311.68052OpenAlexW1980204294MaRDI QIDQ4069798FDOQ4069798
Authors: S. R. Kosaraju 
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0204028
Cited In (19)
- A parallel parsing algorithm for arbitrary context-free grammars
- An NC algorithm for recognizing tree adjoining languages
- Parallel parsing of tree adjoining grammars on the connection machine
- INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
- Optimal simulation of tree arrays by linear arrays
- Parallel recognition and ranking of context-free languages
- Iterative tree arrays with logarithmic depth†
- Two-dimensional iterative arrays: Characterizations and applications
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- An optimal sublinear time parallel algorithm for some dynamic programming problems
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
- Parallel \(LL\) parsing
- Systolic parsing of context-free languages
- A computation model with automatic functions and relations as primitive operations
- Optimal tradeoffs for addition on systolic arrays
- On the relationship between propagating context-dependent Lindenmayer systems and cellular automata systems
- Iterative arrays with direct central control
- Topological transformations as a tool in the design of systolic networks
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
This page was built for publication: Speed of Recognition of Context-Free Languages by Array Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4069798)
