Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3978426
- Parallel recognition and parsing on mesh connected computers with multiple broadcasting
- Parallel Parsing on a One-Way Array of Finite-State Machines
- A parallel parsing algorithm for arbitrary context-free grammars
- scientific article; zbMATH DE number 4205997
Cites work
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 3573276 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A Theorem on Boolean Matrices
- A modification of Warshall's algorithm for the transitive closure of binary relations
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
- General context-free recognition in less than cubic time
- Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
- Speed of Recognition of Context-Free Languages by Array Automata
Cited in
(4)- VLSI architectures for string matching and pattern matching
- Efficient reconfigurable embedded parsers
- Parallel recognition and parsing on mesh connected computers with multiple broadcasting
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
This page was built for publication: Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084875)