VLSI architectures for syntactic pattern recognition algorithms
Conference
·
OSTI ID:5107022
Extended summary only given. Two VLSI architectures are introduced for syntactic pattern recognition algorithms. Two types of algorithms are considered: context-free language recognition and string matching. Context-free languages are most commonly used in the mentioned areas and their recognition methods have been well studied. The recognition methods employed are based on the Cocke-Younger-Kasami (CYK) algorithm and Early's algorithm. Multiprocessing and pipelining techniques are used in the architectures to execute the algorithm in parallel. 5 references.
- OSTI ID:
- 5107022
- Country of Publication:
- United States
- Language:
- English
Similar Records
VLSI architectures for syntactic pattern recognition
Syntactic pattern recognition: an introduction
VLSI architectures for high speed recognition of context-free languages and finite-state languages
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5294415
Syntactic pattern recognition: an introduction
Book
·
Sat Dec 31 23:00:00 EST 1977
·
OSTI ID:5850937
VLSI architectures for high speed recognition of context-free languages and finite-state languages
Conference
·
Thu Dec 31 23:00:00 EST 1981
·
OSTI ID:6483090