A complex measure of non-regular languages for discrete-event supervisory control

被引:0
|
作者
Chattopadhyay, I [1 ]
Ray, A [1 ]
Wang, X [1 ]
机构
[1] Penn State Univ, University Pk, PA 16802 USA
关键词
language measure; discrete event supervisory control; linear grammars;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The measure of regular languages, recently introduced in technical literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). This paper extends the signed real measure of regular languages, to a complex measure of non-regular languages, generated by linear context free grammars; the concept is illustrated by an example. The complex measure becomes equivalent to the signed real measure if the linear context free grammar is degenerated to a regular grammar.
引用
收藏
页码:5120 / 5125
页数:6
相关论文
共 50 条