Scribd
Upload
68 views3 pages

Theory of Automata-Assignment 3

This document provides instructions for Assignment 3 on the theory of automata. It includes 3 tasks: 1) Use pumping lemma to show 4 languages are nonregular. 2) For 5 pairs of regular languages, find a regular expression and finite automaton (FA) that defines each language. 3) Show that two given Mealy machines are inverse machines of each other.

Uploaded by

Hasnain Hassan
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
68 views3 pages

Theory of Automata-Assignment 3

This document provides instructions for Assignment 3 on the theory of automata. It includes 3 tasks: 1) Use pumping lemma to show 4 languages are nonregular. 2) For 5 pairs of regular languages, find a regular expression and finite automaton (FA) that defines each language. 3) Show that two given Mealy machines are inverse machines of each other.

Uploaded by

Hasnain Hassan
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

Theory Of Automata

ASSIGNMENT#3

Course Instructor: Arslan Anjum


[email protected]

Session: Fall 2023


School of Systems and Technology,
UMT Lahore Pakistan
Theory Of Automata
Assignment 3
CLO-4

Purpose: To learn about the key terminologies of Automata Languages, Regular Expressions and
Finite Automata

Instructions:
1. Submission deadline: December 30, 2023
2. Late submissions will not be accepted.
3. Copied assignments either from internet or student will be marked as 0.
4. Study the book chapter and its exercise, before going to solve problems.
5. Submit hand written assignment to class CR.

Study Resources: Study chapter 8,9,10 with its exercise, of INTRODUCTION TO COMPUTER
THEORY SECOND EDITION Daniel I. A. Cohen

Assignment Tasks
Task#1: Use the pumping lemma to show that each of these languages is nonregular:
(i) { an bn+ 1 } = { abb aabbb aaahbbb }
(ii) { anbnan } = { aba aabbaa aaabbbaaa aaaabbbbaaaa }
(iii) { a"b2n } = { abb aabbbb aaabhbbbb }
(iv) { an ban} = { aba aabaa aaabaaa }

Task#2: For each of the following pairs of regular languages, find a regular expression and an
FA that each define L1 and L2:
1. (a + b)*a b(a + b)*
2. (a + b)*a (a + b)*aa(a + b)*
3. (a + b)*a (a + b)*b
4. (a + b)b(a + b)* b(a + b)*
5. (a + b)b(a + b)* (a + b)*aa(a + b)*

Task#3: You are given these two Mealy machines:


Notice that they are indeed different and show that each is the inverse machine of the other ,that
means that
(Me1)(Me2) = identity = (Me2)(Me1)

You might also like