0% found this document useful (0 votes)
3 views

Unit 1

The document outlines the construction of various Deterministic Finite Automata (DFA) for specific conditions involving strings over the alphabet {a, b} and {0, 1}. It also discusses the elimination of Є-moves in DFAs, the concepts of Moore and Mealy machines, and the minimization of DFAs. Additionally, it defines regular languages and their representation through regular expressions.

Uploaded by

Abhi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Unit 1

The document outlines the construction of various Deterministic Finite Automata (DFA) for specific conditions involving strings over the alphabet {a, b} and {0, 1}. It also discusses the elimination of Є-moves in DFAs, the concepts of Moore and Mealy machines, and the minimization of DFAs. Additionally, it defines regular languages and their representation through regular expressions.

Uploaded by

Abhi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Construct a DFA ending with ‘a’,

Σ={a,b}
Construct a DFA which accepts all strings over (0,1)
in which second symbol is ‘0’ and fourth symbol ‘1’
Construct a DFA ending with even
no. of ‘a’ and even no. of ‘b’,
Σ={a,b}
Construct a DFA ending with odd no.
of ‘a’ and odd no. of ‘b’, Σ={a,b}
Construct a DFA ending with even
no. of ‘a’ and odd no. of ‘b’,
Σ={a,b}
Construct a DFA ending with odd no.
of ‘a’ and even no. of ‘b’, Σ={a,b}
Eliminate Є-moves
Rules:
1. Find all edges starting from S2
2. Duplicate all edges to S1 without changing edge labels
3. If S1 is initial state, make S2 initial
4. If S2 is final state, make S1 final
5. Remove Dead state
Equivalence of DFA
Moore Machine
N input n+1 output
00110 aaabaa
Moore to Mealy Conversion
Moore to Mealy Conversion
Mealy-Moore Machine
Mealy-Moore Machine
Minimization of DFA
Regular Language
Regular Language is the one which is accepted at Finite Automata and
Regular Expressions represents Regular Language

You might also like