About number of states of automaton modifying its diagram

Maslenikov Denis Olegovich

About number of states of automaton modifying its diagram

Maslenikov D. O.

Maslenikov Denis Olegovich

student, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Chair of Mathematical Theory of Intellectual Systems

Published: 2024, vol. 28, issue 1, pp. 86–97

Download full text (In Russian)

Abstract

Definitions of a rule and a result of applying it to а finite automaton are introduced. The present paper considers the result of applying the rule to the automaton as a boundedly deterministic function and a finite automaton that realizes this function. Equivalence of two definitions of a result of applying a rule to an automaton is proved. The paper provides estimations of largest and smallest number of states of the automaton.

Keywords: finite automaton, self-modifying finite state machine, Moore diagram.

BibTeX

@article{IS-Maslenikov2024,
  author  = {Maslenikov, Denis Olegovich},
  title   = {{About number of states of automaton modifying its diagram}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2024},
  volume  = {28},
  number  = {1},
  pages   = {86--97},
}

AMSBIB

\Bibitem{IS-Maslenikov2024}
\by D.\,O.~Maslenikov
\paper About number of states of automaton modifying its diagram
\jour Intelligent Systems. Theory and Applications
\yr 2024
\vol 28
\issue 1
\pages 86--97
\lang In Russian

Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue