TY - GEN
T1 - A complex measure of non-regular languages for discrete-event supervisory control
AU - Chattopadhyay, Ishanu
AU - Ray, Asok
AU - Wang, Xi
PY - 2004
Y1 - 2004
N2 - 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 (equivalentiy, 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.
AB - 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 (equivalentiy, 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.
KW - Discrete Event Supervisory Control
KW - Language Measure
KW - Linear Grammars
UR - https://www.scopus.com/pages/publications/7544230632
UR - https://www.scopus.com/pages/publications/7544230632#tab=citedBy
U2 - 10.1109/ACC.2004.249127
DO - 10.1109/ACC.2004.249127
M3 - Conference contribution
AN - SCOPUS:7544230632
SN - 0780383354
T3 - Proceedings of the American Control Conference
SP - 5120
EP - 5125
BT - Proceedings of the 2004 American Control Conference (AAC)
T2 - Proceedings of the 2004 American Control Conference (AAC)
Y2 - 30 June 2004 through 2 July 2004
ER -