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 language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 2004 American Control Conference (AAC) |
| Pages | 5120-5125 |
| Number of pages | 6 |
| Volume | 6 |
| DOIs | |
| State | Published - 2004 |
| Event | Proceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States Duration: Jun 30 2004 → Jul 2 2004 |
Other
| Other | Proceedings of the 2004 American Control Conference (AAC) |
|---|---|
| Country/Territory | United States |
| City | Boston, MA |
| Period | 6/30/04 → 7/2/04 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering