|
%I #7 Nov 08 2013 23:36:29
%S 2,8,112,2164,51008,1346924
%N Number of distinct finite languages over 4-ary alphabet, whose minimum regular expression has alphabetic width n.
%H Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, <a href="http://arxiv.org/abs/1204.4982">Enumerating regular expressions and their languages</a>, arXiv:1204.4982v1 [cs.FL]
%K nonn,hard
%O 1,1
%A _Hermann Gruber_, Apr 25 2012
|
