Scribd
Upload
9 views2 pages

Dsat Ia2 QB

The document outlines various topics related to automata theory, including the differences between NFA and DFA, types of grammar, and the design of automata for specific languages. It also covers the conversion of regular grammars to DFA, the construction of context-free grammars, and the definition of Moore and Mealy machines. Additionally, it includes exercises on deriving strings and simplifying grammars.

Uploaded by

Akshat Ravi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views2 pages

Dsat Ia2 QB

The document outlines various topics related to automata theory, including the differences between NFA and DFA, types of grammar, and the design of automata for specific languages. It also covers the conversion of regular grammars to DFA, the construction of context-free grammars, and the definition of Moore and Mealy machines. Additionally, it includes exercises on deriving strings and simplifying grammars.

Uploaded by

Akshat Ravi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1. 3Differentiate NFA and DFA (4 valid difference).

2. Write short note on Types of Grammar.


3. Design NFA for recognizing the strings that end in “aa” over ∑ = {a,b} & convert above NFA to
DFA
4. Define regular expression and write a regular expression for language
5. Strings containing at most one ‘a’ over Σ = {a, b,c}
6. String that start and ends in different alphabet over Σ = {a, b}
7. String that contains even number of a’s over Σ = {a, b}
8. Strings containing odd number of b’s over Σ= {a, b}.
9. Differentiate between Moore and Mealy machine (4 valid difference)
10. Convert RLG to DFA
a. A -> bB
b. B -> aB/Bb/€(epsilon)

11.

12. Construct a CFG that generates the language of all strings over the alphabet {a, b}
13. where the number of 'a's is twice the number of 'b's.
14.

15. Simplify the grammar


a. S ->aMb
b. M->aMb
c. M->€(epsilon)
16. Design a CFG that generates the language of all strings over the alphabet {0, 1}
that contain an equal number of 0's and 1's.
17. Design DFA in which input is valid if it starts either in ‘011’ or ‘100’ over Σ={0,1}.
18. Define PDA and design a PDA to accept an odd length palindrome over {a,b} Reduce the
following Grammars to the Chomsky normal form
a. S →1A | 0B
b. A →1 AA | 0S | 0
c. B →0BB | 1S |1
d.
19. Let G be the grammar3
i. S→ aB | bA
b. A→ a |aS| bAA
c. B→ b |bS| aBB
20. Find leftmost derivation, rightmost derivation and parse tree for the string “bbaaabbaba”
21. Consider the following CFG: G = { (S, A), (a, b), P, S}, where P consists of :
S→aAS | a
A→SbA | SS | ba
Derive the string ‘aabbaa’ using leftmost derivation and rightmost derivation
22. Describe Moore machine with all tuples in detail.
23. Arrange a mealy machine to accept all strings ending with 00 or 11

You might also like