[seqfan] Re: Sirag numbers.

[Georgi Guninski]

On Thu, Sep 29, 2011 at 11:38:33PM -0400, David Wilson wrote:
> 
> Sirag numbers are 2-automatic, that is, there is a finite automaton
> that accepts precisely their base-2 numerals.
>

I admit my ignorance but is there a name for X-CFG-"automatic" sequences, where the $X$ context free grammar over alphabet {0,1} accepts precisely their base-2 numerals?

$X$ is defined by the productions, possibly in CNF.

-- 
joro