The Gateway to Computer Science Excellence
+3 votes
312 views

Match the following : 

LIST-I LIST-II
a. Context free grammar  i. Linear bounded automaton 
b. Regular grammar  ii. Pushdown automaton 
c. Context sensitive grammar  iii. Turing machine 
d. Unrestricted grammar  iv. Deterministic finite automaton 

Codes :

           a        b        c        d 

  1. ii        iv       iii         i 
  2. ii        iv        i        iii 
  3. iv       i         ii        iii 
  4. i        iv       iii         ii  
in Theory of Computation by Boss (30.2k points)
recategorized by | 312 views

1 Answer

+3 votes
Best answer

chomsky hirarchky

B is ans

by Veteran (62.7k points)
selected by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,508 answers
195,558 comments
101,064 users