Doklady Akademii Nauk, Tome 180 (1968) no. 5, pp. 1053-1055
Citer cet article
Yu. Ya. Breitbart. Comparison of the complexities of realization of Boolean functions by automata and Turing machines. Doklady Akademii Nauk, Tome 180 (1968) no. 5, pp. 1053-1055. http://geodesic.mathdoc.fr/item/DAN_1968_180_5_a10/
@article{DAN_1968_180_5_a10,
author = {Yu. Ya. Breitbart},
title = {Comparison of the complexities of realization of {Boolean} functions by automata and {Turing} machines},
journal = {Doklady Akademii Nauk},
pages = {1053--1055},
year = {1968},
volume = {180},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1968_180_5_a10/}
}
TY - JOUR
AU - Yu. Ya. Breitbart
TI - Comparison of the complexities of realization of Boolean functions by automata and Turing machines
JO - Doklady Akademii Nauk
PY - 1968
SP - 1053
EP - 1055
VL - 180
IS - 5
UR - http://geodesic.mathdoc.fr/item/DAN_1968_180_5_a10/
LA - ru
ID - DAN_1968_180_5_a10
ER -
%0 Journal Article
%A Yu. Ya. Breitbart
%T Comparison of the complexities of realization of Boolean functions by automata and Turing machines
%J Doklady Akademii Nauk
%D 1968
%P 1053-1055
%V 180
%N 5
%U http://geodesic.mathdoc.fr/item/DAN_1968_180_5_a10/
%G ru
%F DAN_1968_180_5_a10