Abstract
This paper reviews and extends the recent work on signed real measure of regular languages within a unified framework. The language measure provides total ordering of partially ordered sets of sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The paper presents a procedure by which performance of different supervisors can be evaluated based on a common quantitative tool. Two algorithms are provided for computation of the language measure and their equivalence is established along with a physical interpretation from the probabilistic perspective.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 485-503 |
| Number of pages | 19 |
| Journal | Demonstratio Mathematica |
| Volume | 37 |
| Issue number | 2 |
| DOIs | |
| State | Published - Apr 2004 |
All Science Journal Classification (ASJC) codes
- General Mathematics