Contex-free Grammar (CFG) can be recognized by

PYQ UGC NET 2009

Contex-free Grammar (CFG) can be recognized by

  1. A.

    Finite state automata

  2. B.

    2-way linear bounded automata

  3. C.

    push down automata

  4. D.

    both (B) and (C)

Attempted by 33 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…