recategorized by
1,931 views

2 Answers

0 votes
0 votes

Option D

Turing Machine recognises ALL 
Linear Bounded Automata  recognises CSL , CFL , RL 
Push down automata recognises CFL , RL 
Finite Automata recognises only RL 

Related questions

1 votes
1 votes
2 answers
1
Pooja Khatri asked Jul 13, 2018
15,277 views
Two finite state machines are said to be equivalent if they:Have the same number of edgesHave the same number of statesRecognize the same set of tokensHave the same numbe...
0 votes
0 votes
2 answers
2
0 votes
0 votes
6 answers
3
0 votes
0 votes
3 answers
4
Pooja Khatri asked Jul 13, 2018
3,224 views
Pushdown automata can recognize language generated by _______Only context free grammarOnly regular grammarContext free grammar or regular grammarOnly context sensitive gr...