Lecture note Theory of automata - Lecture 21

Lecture Theory of automata - Lecture 21 includes the following content: Example of moore machine, mealy machine, examples, complementing machine, incrementing machine.

Lecture # 30

Theory Of Automata

By

Dr MM Alam

1

Lecture# 29 Recap

• At every stage we have the following equivalence:

Working string = (letters cancelled from TAPE) (string of nonterminals from STACK

working string = S

letters cancelled = none

string of nonterminals in STACK = ∆

3

• At the end this means:

working string = the whole word

letters cancelled = all

STACK= ∆

PDA Examples in JFLAP

5

PDA Example

one diagram

Example in JFLAP

Even Palindrome

7

Palindrome with X

• Chomsky Normal Form in JFLAP Repeat

Lecture 30 Summary