About expressibility of automata with superposition

Babin Dmitry Nikolaevich; Letunovskiy Alexey Alexandrovich

About expressibility of automata with superposition

Babin D. N., Letunovskiy A. A.

Babin Dmitry Nikolaevich

Doctor of Physical and Mathematical Sciences, Prof., Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Chair of Mathematical Theory of Intellectual Systems

Letunovskiy Alexey Alexandrovich

Published: 2023, vol. 27, issue 4, pp. 76–78

Download full text (In Russian)

Abstract

Expressibility of constant and linear automata for extended superposition is decidable. There is a theorem about decidability of automaton with linear transition expressibility.

Keywords: extended superposition, expressibility, linear automata, decidability.

BibTeX

@article{IS-Babin-Letunovskiy2023,
  author  = {Babin, Dmitry Nikolaevich and Letunovskiy, Alexey Alexandrovich},
  title   = {{About expressibility of automata with superposition}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2023},
  volume  = {27},
  number  = {4},
  pages   = {76--78},
}

AMSBIB

\Bibitem{IS-Babin-Letunovskiy2023}
\by D.\,N.~Babin, A.\,A.~Letunovskiy
\paper About expressibility of automata with superposition
\jour Intelligent Systems. Theory and Applications
\yr 2023
\vol 27
\issue 4
\pages 76--78
\lang In Russian

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

← Back to issue