I assume you wrote a description of a nondeterministic finite automaton that accepts this language. I think it is correct.
Can somebody help me with this question.
I thought this might be the solution but am not sure:Construct a regular grammar that generates the language L over the alphabet {0,1}, where
L = {1,1000,1000000,1000000000,...}
so that a string of binary digits belongs to L if and only if it consists of the digit 1 followed by a string of 3n Zeroes, for some non - negative integer n. Specify your formal grammar in Backus-Naur form.
S -> 1<T1> | 1<F>
T1 -> 0<T2>
T2 -> 0<T3>
T3 -> 0<T1>| 0<F>
F -> <EMPTY SET>
Any help would be greatly appreciated.
I am sorry, I missed that the problem statement says to construct a regular grammar; that's why I thought about automata. Yes, what you have is a regular grammar that generates the required language.
In addition, this can also be considered a description of a nondeterministic finite automaton. From this it is pretty obvious that regular grammars and NDFAs describe the same class of languages (it's a standard theorem).