adplus-dvertising
frame-decoration

Question

Match the following:

a. Context sensitive language          i. Deterministic finite automation
b. Regular grammar                            ii. Recursive enumerable
c. Context free grammar                     iii. Recursive language
d. Unrestricted grammar                     iv. Pushdown automation

Codes:
      a   b    c   d

a.

ii    i    iv   iii

b.

iii   iv   i    ii

c.

iii   i    iv   ii

d.

ii    iv   i   iii

Answer: (c).iii   i    iv   ii

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Match the following: a. Context sensitive language          i. Deterministic finite automation b. Regular grammar                            ii. Recursive enumerable c....

Similar Questions

Discover Related MCQs

Q. The statements s1 and s2 are given as:

s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.
s2: Context free languages are closed under complementation, substitution and homomorphism.

Which of the following is correct statement?

Q. Consider the following statements :

I. Recursive languages are closed under complementation.
II. Recursively enumerable languages are closed under union.
III. Recursively enumerable languages are closed under complementation.

Which of the above statements are true ?

Q. Given the following statements :

(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.

Which of the above is the correct statement(s) ?

Q. Which is not the correct statement(s) ?

(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.

Q. Which one of the following is not a Greibach Normal form grammar?

(i)            S ->a|bA|aA|bB
A->a
B->b
(ii)           S->a|aA|AB
A->a
B->b
(iii)          S->a|A|aA
A->a

Q. The equivalent grammar corresponding to the grammar G:S→aA,A→BB,B→aBb∣εG:S→aA,A→BB,B→aBb∣ε is

Q. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

Q. The following CFG

S->aB|bA, A->a|as|bAA, B->b|bs|aBB

generates strings of terminals that have

Q. Match the following :

(i) Regular Grammar                           (a) Pushdown automaton
(ii) Context free Grammar                   (b) Linear bounded automaton
(iii) Unrestricted Grammar                  (c) Deterministic finite automaton
(iv) Context Sensitive Grammar        (d) Turing machine
     
(i)   (ii)   (iii)  (iv)

Q. Which one of the following statement is false?

Q. Which of the following grammar is LR (1)?

Q. Context-free Grammar (CFG) can be recognized by

Q. A context free grammar is:

Q. Let e: B˄m→B˄n is a group code. The minimum distance of ‘e’ is equal to:

Q. A WFF that is equivalent to the WFF x=>y is:

Q. The regular expression given below describes:

r=(1+01)*(0+λ)

Q. Which of the following language is regular?

Q. Which of the regular expressions corresponds to this grammar ?

S → AB / AS, A → a / aA, B → b

Q. Which of the following strings is in the language defined by grammar S→0A, A→1A/0A/1

Q. The logic of pumping lemma is a good example of: