%0 Journal Article
%A N. Yu. Demin
%T On the number of rules needed for an automaton grammar to generate a finite language
%J Diskretnaya Matematika
%D 2000
%P 99-108
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2000_12_4_a7/
%G ru
%F DM_2000_12_4_a7