a) Push down automata
b) 2 way linearly bounded automata
c) Push down automata & 2 way linearly bounded automata
d) None of the mentioned
A context free grammar can be recognized by
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
A context free grammar can be recognized by
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!