### Abstract

This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic finite state automata (DFSA). The state-based optimal control policy is obtained by selectively disabling controllable events to maximize a signed 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 of a polynomial order in n.

Original language | English (US) |
---|---|

Pages (from-to) | 799-804 |

Number of pages | 6 |

Journal | Proceedings of the IEEE Conference on Decision and Control |

Volume | 1 |

Publication status | Published - Dec 1 2002 |

Event | 41st IEEE Conference on Decision and Control - Las Vegas, NV, United States Duration: Dec 10 2002 → Dec 13 2002 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization