D. N. Babin, A. A. Letunovskii, “About expressibility of automata with superposition”, Intelligent systems. Theory and applications, 2023, Volume 27, Issue 4,Pages <nobr>76

Part 3. Mathematical models

About expressibility of automata with superposition

D. N. Babin, A. A. Letunovskii

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

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