Scribd
Upload
12 views3 pages

Master Assignment

Uploaded by

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

Master Assignment

Uploaded by

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

Master Assignment

1. Define: (i) Finite Automaton (FA) (ii) Transition diagram


2. What are the applications of automata theory?
3. Define Alphabet, String, and Language in Formal Language Theory.
4. Write a Regular Expression for a language L that starts or ends with 00 or 11.
5. Differentiate between L* and L+ with examples.
6. Define Regular Expression. Give one RE and its corresponding language.
7. Define any two algebraic laws with examples.
8. What is Arden’s Theorem?
9. Write any two closure properties of Regular Languages.
10. Define Context-Free Grammar (CFG).
11. Define NFA with ε-transitions.
12. What do you mean by the language accepted by an automaton?
13. Define Chomsky Hierarchy.
14. What is a Mealy Machine?
15. Define a Moore Machine with an example.
16. What is ambiguity in a CFG?
17. Define Deterministic PDA and Non-deterministic PDA.
18. What is the difference between a language and grammar?
19. Define a Turing Machine.
20. What is a Decidable Problem?

1. Differentiate between DFA and NFA with suitable examples.


2. Construct a DFA that accepts strings ending with “01”.
3. Define PDA with an example and explain Chomsky Normal Form.
4. Convert the following NFA to DFA:
States = {q0, q1}, Σ = {0,1},
δ(q0, 0) = {q0}, δ(q0, 1) = {q0, q1}, δ(q1, 1) = {q1}
Initial state: q0, Final state: q1.
5. Write the difference between Mealy and Moore Machines with example.
6. Explain the procedure to convert ε-NFA to NFA.
7. Construct a Regular Expression for binary strings divisible by 3.
8. Construct a PDA that accepts L = {aⁿbⁿcⁿ | n ≥ 0}.
9. Construct a mealy machine where ∑={0,1} △={a,b,c}, machine should give output a , if the
input string ends with 10, b if input string ends with 11,c otherwise.
10. Prove that Regular languages are closed under union and concatenation.
11. Convert the Regular Expression r = (a+b)*abb into a DFA.
12. Construct a CFG for palindromes over {a, b}.
13. Show the equivalence between DFA and Regular Expressions.
14. Differentiate between Context-Free and Context-Sensitive Grammars.
15. Define and explain Instantaneous Description (ID) in PDA.
16. Describe how a PDA simulates stack operations.
17. Construct a CFG for the language L = {aⁿbⁿ | n ≥ 0}.
18. Convert the CFG: S → aSb | ε into Greibach Normal Form.
19. Explain the use of FA in lexical analysis.
20. Construct a DFA to accept strings with even number of 0s and 1s.

1. Convert the following ε-NFA to NFA: Provide states, transition table, and diagram.

2. Define a Turing Machine and differentiate Decidable and Undecidable problems with
examples.
3. Define ambiguity in a grammar. Distinguish between grammar ambiguity and
inherent ambiguity.
4. Explain the Post Correspondence Problem with example.
5. Design a PDA to accept the language L = {0ⁿ1ⁿ | n ≥ 0}.
6. Show that the language {aⁿbⁿcⁿ | n ≥ 1} is not context-free.
7. Discuss the DFA minimization algorithm with a step-by-step example.
8. State and prove the Pumping Lemma for Regular Languages. Use it to show L = {aⁿbⁿ
| n ≥ 1} is not regular.
9. Describe the Halting Problem and its implications in computation.
10. Explain the equivalence of CFG and PDA with a suitable proof.
11. Design a TM that accepts binary strings with equal number of 0s and 1s.
12. Describe the steps to convert PDA to CFG.
13. Construct a Turing Machine for L = {aⁿbⁿcⁿ | n ≥ 1}.
14. Define Universal Turing Machine. How is it different from a regular TM?
15. Describe Church-Turing Thesis and its significance.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy