Upper estimations of autonomous automata planar scheme

Vorotnikov Alexey Sergeevich

Upper estimations of autonomous automata planar scheme

Vorotnikov A. S.

Vorotnikov Alexey Sergeevich

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

Published: 2023, vol. 27, issue 2, pp. 84–110

Download full text (In Russian)

Abstract

Switchable power of ﬂat automatic schema without inputs implementation by periodical sequence is recieved in this work. A scheme is given that implements arbitrary predeﬁned sequence of length \(2^n\) for positive integer \(n\) with switchable power no more than \(\frac{2^{n/2}}{n}\).

Keywords: boolean circuit , ﬁnite automata, models of VLSI, planar circuit, circuit power, Shannon function, upper estimations.

BibTeX

@article{IS-Vorotnikov2023,
  author  = {Vorotnikov, Alexey Sergeevich},
  title   = {{Upper estimations of autonomous automata planar scheme}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2023},
  volume  = {27},
  number  = {2},
  pages   = {84--110},
}

AMSBIB

\Bibitem{IS-Vorotnikov2023}
\by A.\,S.~Vorotnikov
\paper Upper estimations of autonomous automata planar scheme
\jour Intelligent Systems. Theory and Applications
\yr 2023
\vol 27
\issue 2
\pages 84--110
\lang In Russian

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

← Back to issue