SIMPLIFIED UNIVERSAL AUTOMATON AND ENUMERATION OF AUTOMATA WITH TWO STATES

  • Vasily Nikolaevich Dolgov

Abstract

This paper introduces the notion of simplified universal automaton, as well as some interesting facts about enumeration of finite automata with two states and their tables of correspondence #.

Section
Technical Sciences