Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

Computing Numerical Functions by Certain Types of Automata

Abstract

This paper investigates countably-valued functions computed by classical automata and automata with stops. The properties of encodings that convert numbers into automaton input sequences and vice versa are examined. We identify the classes of functions computable by the specified types of automata under these encodings.

Keywords: computability, automaton.

BibTeX
@article{IS-Litovskiy2026,
  author  = {Litovskiy, Vladislav Andreevich},
  title   = {{Computing Numerical Functions by Certain Types of Automata}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {107--111},
}
AMSBIB
\Bibitem{IS-Litovskiy2026}
\by V.\,A.~Litovskiy
\paper Computing Numerical Functions by Certain Types of Automata
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 107--111
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover