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

Pattern Recognition Letters

Volumn 21, Issue 2, 2000, Pages 179-187

  Jurek, Janusz ^a  

^a JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Context sensitive languages; Parsing; Programmed grammars; Syntactic pattern recognition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE LANGUAGES;

PARSING ALGORITHMS;

PATTERN RECOGNITION;

EID: 0033874570     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(99)00145-2     Document Type: Article

References (7)

1. Aho A.V., Ullman J.D. The Theory of Parsing, Translation, and Compiling. 1972;Prentice-Hall, Englewood Cliffs, NJ.
2. Behrens U., Flasiński M., Hagge L., Jurek J., Ohrenberg K. Recent developments of the ZEUS expert system ZEX. IEEE Trans. Nucl. Sci. NS-43:1996;65-68.
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. Flasiński M., Jurek J. Dynamically programmed automata for quasi-context sensitive languages as a tool for inference support in pattern recognition-based real-time control expert systems. Pattern Recognition. 32(4):1999;671-690.
5. Fu K.S. Syntactic Pattern Recognition and Applications. 1982;Prentice-Hall, Englewood Cliffs, NJ.
6. Rosenkrantz D.J. Programmed grammars and classes of formal languages. J. ACM. 16:1969;107-131.
7. Rosenkrantz D.J., Stearns R.E. Properties of deterministic top-down grammars. Information and Control. 17:1970;226-256.