An Alternative Approach to the Study of the Conway’s Universal Finite Automaton

This article discusses another approach to the concept and construction of the so-called universal automaton, through the definition of an equivalent COM automaton, and this definition is constructive, it is possible to build the specified automaton. Some well-known estimates of the exact upper bound of the size of a universal automaton for a regular language are given, which can be given using some nondeterministic finite automaton having k states, and a series of examples is considered that shows how fast the number of blocks can grow, i.e. the size of a universal automaton, if we are given the dimensions of both canonical automata. The property is given that in a table specifying the relation # associated with a COM automaton equivalent to a universal automaton, the number of columns cannot be significantly greater than the number of rows #CSOC1120.