The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent ...

A Deterministic Finite Automaton (DFA) is a theoretical model of computation used to design and analyze the behavior of systems with a finite number of states, where each state transitions ...

Existence of such 'deterministic equivalents' in the form of specified convex programming problems is here established for a general class of linear decision rules under the following 3 classes of ...