Title :
Signed real measure of regular languages
Author :
Wang, Xi ; Ray, Asok
Author_Institution :
Dept. of Mech. Eng., Pennsylvania State Univ., University Park, PA, USA
Abstract :
This paper formulates a signed real measure of sub-languages 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 sub-languages 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.
Keywords :
computational complexity; deterministic automata; finite automata; formal languages; automata theory; computational complexity; deterministic finite state automata; language measure algorithm; partially ordered sublanguages; polynomial order; quantitative evaluation; regular languages; signed real measure; sublanguages; Automata; Automatic control; Computational complexity; Formal languages; Law; Legal factors; Mechanical engineering; Mechanical variables measurement; Performance analysis; Polynomials;
Conference_Titel :
American Control Conference, 2002. Proceedings of the 2002
Print_ISBN :
0-7803-7298-0
DOI :
10.1109/ACC.2002.1024544
