Scribd
Upload
4 views

афтомат

The document outlines key concepts in automata theory, including finite automata types (DFA and NFA), state machines (Moore and Mealy), and conversion rules for grammars. It provides examples of constructing DFAs for specific conditions and discusses the formal definition of grammar in language syntax. Additionally, it mentions methods for converting NFAs to DFAs and regular expressions for specific language patterns.

Uploaded by

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

афтомат

The document outlines key concepts in automata theory, including finite automata types (DFA and NFA), state machines (Moore and Mealy), and conversion rules for grammars. It provides examples of constructing DFAs for specific conditions and discusses the formal definition of grammar in language syntax. Additionally, it mentions methods for converting NFAs to DFAs and regular expressions for specific language patterns.

Uploaded by

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

1.

B) 2
2. C) 5
3. D) 5
4. B) Context Free Grammar
5. B) All the strings except epsilon

6. Regular
7. ε-closure of states
8. 2
9. 5-tuple
10. equal

11. A finite automaton is a mathematical model of computation consisting of


states, transitions, an initial state, and accepting states. Types: Deterministic
Finite Automaton (DFA) and Non-Deterministic Finite Automaton (NFA)

12. Moore and Mealy Machines are finite-state machines with outputs. Moore
machine’s output depends only on states, while Mealy machine’s output depends on
both states and inputs.

13. DFA for ((a+b)(a+b))*: Construct a state transition diagram ensuring all
strings of even length are accepted.

14. DFA for even number of a’s and b’s: Construct a state machine tracking parity
of a’s and b’s with four states (even-even, even-odd, odd-even, odd-odd).

15. Rules for converting grammar to CNF:


• Eliminate null productions.
• Eliminate unit productions.
• Remove useless symbols.
• Convert productions to proper CNF form (A → BC or A → a).

Answer any Two:


16. Grammar is a formal system defining syntactically correct strings in a
language. Example: Regular Grammar for a is S → aS | ε.*

17. Non-Deterministic Finite Automata (NFA) allows multiple transitions for the
same input. Draw NFA for L = {aaa, bab, aababa, abbba}.

18. Regular expression for w, w%3 = 0 is (a+b)(a+b)(a+b)*. DFA will have three
states tracking mod 3 count of input length.

19. Convert given NFA to DFA by constructing a transition table and applying the
subset construction method.

You might also like