A context free grammar can be recognized by
Posted: Thu Jul 14, 2022 9:24 am
a) Push down automata
b) 2 way linearly bounded automata
c) Push down automata & 2 way linearly bounded automata
d) None of the mentioned
b) 2 way linearly bounded automata
c) Push down automata & 2 way linearly bounded automata
d) None of the mentioned