A Language Measure for Supervisory Control

A. Ray, A. Surana, S. Phoha

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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 measure serves as a metric for the infinite-dimensional vector space of the sublanguages of a regular language over the finite field GF(2). The computational complexity of the language measure is of polynomial order in the number of plant states.

Original languageEnglish (US)
Pages (from-to)985-991
Number of pages7
JournalApplied Mathematics Letters
Issue number7
StatePublished - Oct 2003

All Science Journal Classification (ASJC) codes

  • Applied Mathematics


Dive into the research topics of 'A Language Measure for Supervisory Control'. Together they form a unique fingerprint.

Cite this