A language measure for supervisory control

✍ Scribed by A. Ray; A. Surana; S. Phoha

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 539 KB
• Volume: 16
• Category: Article
• ISSN: 0893-9659
• DOI: 10.1016/s0893-9659(03)90084-x

✦ Synopsis

This

paper formulates a signed real measure for sublanguages of regular languages based on the principles of automata theory and real analysis. The measure provides total ordering on the controlled behavior of a finite-state automaton plant under different supervisors. Total variation of the messure serves ss a metric for the infinite-dimensional vector space of the sublanguages of a regular language over the fmite field GF(2). The computational complexity of the language measure is of polynomial order in the number of plant states.