Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_1996_8_4_a9, author = {A. E. Andreev and A. A. Chasovskikh}, title = {Automaton complexity of two-place {Boolean} bases}, journal = {Diskretnaya Matematika}, pages = {123--133}, publisher = {mathdoc}, volume = {8}, number = {4}, year = {1996}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_1996_8_4_a9/} }
A. E. Andreev; A. A. Chasovskikh. Automaton complexity of two-place Boolean bases. Diskretnaya Matematika, Tome 8 (1996) no. 4, pp. 123-133. http://geodesic.mathdoc.fr/item/DM_1996_8_4_a9/