Abstract
This paper formulates a signed real measure of sublanguages of a regular language based on the principles of automata theory and real analysis. The measure allows total ordering of any set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The computational complexity of the language measure algorithm is of polynomial order in the number of states.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 3937-3942 |
| Number of pages | 6 |
| Journal | Proceedings of the American Control Conference |
| Volume | 5 |
| State | Published - 2002 |
| Event | 2002 American Control Conference - Anchorage, AK, United States Duration: May 8 2002 → May 10 2002 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering