Signed real measure of regular languages

Xi Wang, Asok Ray

Research output: Contribution to journalConference articlepeer-review

29 Scopus citations


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 languageEnglish (US)
Pages (from-to)3937-3942
Number of pages6
JournalProceedings of the American Control Conference
StatePublished - 2002
Event2002 American Control Conference - Anchorage, AK, United States
Duration: May 8 2002May 10 2002

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'Signed real measure of regular languages'. Together they form a unique fingerprint.

Cite this