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 a regular language for quantitative evaluation of the controlled behavior of a deterministic finite-state automaton (DFSA) plant under different supervisors. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.
Original language | English (US) |
---|---|
Pages (from-to) | 817-833 |
Number of pages | 17 |
Journal | Applied Mathematical Modelling |
Volume | 28 |
Issue number | 9 |
DOIs | |
State | Published - Sep 2004 |
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Applied Mathematics