Parallel parsing on a one-way linear array of finite-state machines
From MaRDI portal
Publication:1183569
DOI10.1016/0304-3975(91)90047-6zbMath0756.68072OpenAlexW2020361970MaRDI QIDQ1183569
Hui Wang, Oscar H. Ibarra, Tao Jiang
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90047-6
Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)
Related Items (4)
Finite turns and the regular closure of linear context-free languages ⋮ parallel parsing from recurrence equations ⋮ The Boolean closure of linear context-free languages ⋮ INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
Cites Work
- Characterizations and computational complexity of systolic trellis automata
- On efficient recognition of transductions and relations
- Efficient recognition of rational relations
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Systolic trellis automatat†
- A linear space algorithm for computing maximal common subsequences
- Recognition and parsing of context-free languages in time n3
This page was built for publication: Parallel parsing on a one-way linear array of finite-state machines
