Unconstrained optimal control of regular languages (Q1433065): Difference between revisions

The present study deals with the theory, formulation, and validation of an unconstrained optimal control policy for finite state automata that may have already been subject to constraints such as control specifications. The synthesis procedure is quantitative and relies on a signed real measure of formal languages, which is based on a specified state transition cost matrix and characteristic vector. The control policy induced by the updated state transition cost matrix yields maximal performance and is unique in the sense that controlled language is most permissive (that is least restrictive) among all controller(s) having the optimal performance.