www.bbcnoun.com.ng 
CIT308 6/10

________ is used to prove that a language is not regular.
Pumping lemma

A grammar is in Greibach Normal Form if all productions are of the form _____________.where a is a terminal and x ϵ V*
A à a

Geibach Normal Formal is useful for proving the equivalence of ______
context-free grammars(CFGs) and nondeterministic Pushdown Automata (NPDA).

A nonterminal A in a grammar is nullable if ______________
A => ϵ

Which operator has the highest precedence amongst the options?
Kleene closure

Which of the following is lacking in a Universal Computer?
none of the options

The difference between number of states with regular expressions (x + y) and (x + y)* is ____
0

When are two finite states equivalent ?
same number of states as well as transitions

For a context free grammar, to be useful a symbol X needs to be ____.
finite

To generate a string in the language, one begins with a string consisting of _______ start symbol(s).
1