On the linear computational complexity of the parser for quasi-context sensitive languages-Reference-Cited by-同舟云学术

On the linear computational complexity of the parser for quasi-context sensitive languages

Published:2000-02 Issue:2 Volume:21 Page:179-187
ISSN:0167-8655
Container-title:Pattern Recognition Letters
language:en
Short-container-title:Pattern Recognition Letters

Author:

Jurek Janusz

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software

Reference7 articles.

1. The Theory of Parsing, Translation, and Compiling;Aho,1972

2. Recent developments of the ZEUS expert system ZEX;Behrens;IEEE Trans. Nucl. Sci.,1996

3. Flasiński, M., 1994. Further Development of the ZEUS Expert System: Computer Science Foundations of Design. Deutsches Elektronen Synchrotron, Hamburg (DESY Rep. 94-048)

4. Dynamically programmed automata for quasi-context sensitive languages as a tool for inference support in pattern recognition-based real-time control expert systems;Flasiński;Pattern Recognition,1999

5. Syntactic Pattern Recognition and Applications;Fu,1982

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Approach of Multi-string Parsing for Syntactic Pattern Recognition;Lecture Notes in Networks and Systems;2023

2. On the learning of vague languages for syntactic pattern recognition;Pattern Analysis and Applications;2022-11-23

3. Hybrid Learning Model for Syntactic Pattern Recognition;Progress in Image Processing, Pattern Recognition and Communication Systems;2021-08-18

4. Fundamental methodological issues of syntactic pattern recognition;Pattern Analysis and Applications;2013-03-09

5. Syntactic Pattern Recognition: Survey of Frontiers and Crucial Methodological Issues;Computer Recognition Systems 4;2011