Signed real measure of regular languages

Asok Ray, Xi Wang

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This chapter 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 a set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior of deterministic finite state automata (DFSA) under different supervisors. In the setting of the language measure, a supervisor's performance is superior if the supervised plant is more likely to terminate at a good marked state and/or less likely to terminate at a bad marked state. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.

Original languageEnglish (US)
Title of host publicationQuantitative Measure for Discrete Event Supervisory Control
PublisherSpringer New York
Pages3-37
Number of pages35
ISBN (Print)0387021086, 9780387021089
DOIs
StatePublished - Dec 1 2005

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

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

  • Cite this

    Ray, A., & Wang, X. (2005). Signed real measure of regular languages. In Quantitative Measure for Discrete Event Supervisory Control (pp. 3-37). Springer New York. https://doi.org/10.1007/0-387-23903-0_1