This Questions are contributed by Private Academy Engineering
MODULE 1 – BASIC CONCEPTS AND FINITE AUTOMOTA.
- Difference Between NFA And DFA.
- Explain Application For FA.
- Describe Finite State Machine.
- Explain Conversion Of Moore To Mealy Machines.
- Compare And Contrast Moore And Mealy Machines.
MODULE 2 – REGULAR EXPRESSIONS AND LANGUAGE.
- Explain Decision Properties Of Regular Languages.
- Explain Closure Properties Of Regular Languages.
- Explain Pumping Lemma Of Regular Language.
MODULE 3 – GRAMMERS.
- Explain Chomsky Hierarchy.
- Write A Steps For Converting CFG to CNF Form.
MODULE 4 – PUSHDOWN AUTOMOTA (PDA).
- Differentiate Between NPDA And PDA.
- Explain Application For PDA.
- Explain Acceptance By A PDA.
- Explain PDA And It’s Working.
- Explain Non-Deterministic PDA.
MODULE 5 – TURING MACHINE (TM).
- Explain Variants Of Turing Machine.
- Explain Application For TM.
- Write Short Note On Universal TM.
- Design A TM Accepting All Palindromes Over {0,1}.
- Construct TM To Check Well Formedness Of Parenthesis.
More On WhatsApp – bit.ly/3PVERGc
MODULE 6 – UNDECIDABILITY.
- Explain Post Correspondence Problem.
- Explain Rice’s Theorem.
- Explain Halting Problem Of Turing Machine
Theory Answers – https://Madhav.topsecret.link/0nlsg
Solved Numerical 5 Examples – https://Madhav.topsecret.link/ca3jm
src :
