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

Ishanu Chattopadhyay, Asok Ray, Xi Wang

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations

    Abstract

    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.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 2004 American Control Conference (AAC)
    Pages5120-5125
    Number of pages6
    Volume6
    DOIs
    StatePublished - 2004
    EventProceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States
    Duration: Jun 30 2004Jul 2 2004

    Other

    OtherProceedings of the 2004 American Control Conference (AAC)
    CountryUnited States
    CityBoston, MA
    Period6/30/047/2/04

    All Science Journal Classification (ASJC) codes

    • Control and Systems Engineering

    Fingerprint Dive into the research topics of 'A complex measure of non-regular languages for discrete-event supervisory control'. Together they form a unique fingerprint.

    Cite this