Q. Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is

View solution

Q. The equivalent production rules corresponding to the production rules

S→Sα1|Sα2|β1|β2 is

View solution

Q. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below

The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is

View solution

Q. The grammar with production rules S → aSb |SS|λ generates language L given by:

View solution

Q. A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ

View solution

Q. For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to

View solution

Q. 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

View solution

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?

View solution

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 ?

View solution

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) ?

View solution

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.

View solution

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

View solution

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

View solution

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

View solution

Q. The following CFG

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

generates strings of terminals that have

View solution

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)

View solution

Q. Which one of the following statement is false?

View solution

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

View solution

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

View solution

Q. A context free grammar is:

View solution