Upper bound of switching power of planar circuits for a class of automata

Vorotnikov A.S.

Abstract:

The paper shows that a certain class of automata can be implemented flat automatic circuits with an average switching power per cycle no more than 2^(n/2)/log₂n. A diagram with marked parameters.

Keywords:

finite automata

Publication language: russian, pages: 4 (p. 62-65)

Russian source text:

List of publications citation:

Export link to publication in format:

About authors:

Vorotnikov Alexey Sergeevich, ,