Dynamically programmed automata for quasi context sensitive languages as a tool for inference support in pattern recognition-based real-time control expert systems
An efficient, O( n 2), syntax analyzer for languages generated by (dynamically) programmed grammars is introduced. The class of grammars introduced is stronger descriptively than context-free grammars and it can be used for analysis of complex trend functions describing a behavior of an industrial e...
Saved in:
Published in: | Pattern recognition Vol. 32; no. 4; pp. 671 - 690 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
Oxford
Elsevier Ltd
01-04-1999
Elsevier Science |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | An efficient,
O(
n
2), syntax analyzer for languages generated by (dynamically) programmed grammars is introduced. The class of grammars introduced is stronger descriptively than context-free grammars and it can be used for analysis of complex trend functions describing a behavior of an industrial equipment. The application of a model proposed in the real-time diagnostic expert system is presented. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/S0031-3203(98)00115-0 |