Measure of regular languages

Amit Surana, Asok Ray

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


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 languageEnglish (US)
Pages (from-to)485-503
Number of pages19
JournalDemonstratio Mathematica
Issue number2
StatePublished - Apr 2004

All Science Journal Classification (ASJC) codes

  • General Mathematics


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

Cite this