Theory of Computation
Quick practice
Question 1 of 5
CSG can be defined by.
A
Push down automata.
B
none
C
Finite automata.
D
2-way linear bounded automata.
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go