Unconstrained optimal control of regular languages

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic finite state automata (DFSA). A signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in an earlier publication. The state-based optimal control policy is obtained by selectively disabling controllable events to maximize the measure of the controlled plant language without any further constraints. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model. Each iteration solves a set of n simultaneous linear algebraic equations. As such, computational complexity of the control synthesis is polynomial in n.

Original languageEnglish (US)
Pages (from-to)639-646
Number of pages8
Issue number4
StatePublished - Apr 2004

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering


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

Cite this