Scribd
Upload
7 views2 pages

Exercise01 DFA

This document is an assignment for the course MCA-204C: Formal Language and Automata Theory at Manipur University, due by May 25, 2024. It includes exercises requiring the creation of Deterministic Finite Automata (DFA) for various string conditions over specified alphabets, as well as definitions and explanations of key concepts related to DFA. The assignment covers strings with binary digits, decimal integers, and valid Python variable names.

Uploaded by

zayn96165
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
7 views2 pages

Exercise01 DFA

This document is an assignment for the course MCA-204C: Formal Language and Automata Theory at Manipur University, due by May 25, 2024. It includes exercises requiring the creation of Deterministic Finite Automata (DFA) for various string conditions over specified alphabets, as well as definitions and explanations of key concepts related to DFA. The assignment covers strings with binary digits, decimal integers, and valid Python variable names.

Uploaded by

zayn96165
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/ 2

Department of Computer Science

Manipur University

MCA-204C: Formal Language and Automata Theory

Assignment No. 1

17th May, 2024

Submit or before 25 May 2024

Ex1. Give DFA’s accepting the following strings over the alphabet {0,1}:

i) The set of all strings beginning with 101.

ii) The set of all strings containing 1101 as a substring.

iii) The set of all strings with exactly three consecutive 0’s.

iv) The set of all strings of even length and ending with 10.

v) The set of all strings containing even no of 0’s and odd no of 1’s.

Ex2. Give DFA’s accepting the following strings over the alphabet {0,1}:

i) The set of all strings such that the number of 0’s is even and the number of 1’s is

a multiple of 3.

ii) The set of all strings not containing 101.

iii) The set of all strings that begin with 01 and ends with 11.

iv) The set of all string when interpreted as a binary integer is divisible by 3.

Ex3. Give DFA’s accepting the following strings over the alphabet {0,1,2,3,4,5,6,7,8,9}:

i) The set of all string when interpreted as a decimal integer is divisible by 3.

e.g. 132 and 690 are accepted because they are divisible by 3 but 134 not accepted

because 134 is not divisible by 3.

ii) The set of all string when interpreted as a decimal integer is divisible by 5.

Ex4. Give DFA’s accepting strings over the alphabet {a-z,A-Z,0-9,_} which are

valid Python variables.

Ex5. i) Give the definition of Deterministic Finite Automata (DFA).

ii) Explain the following terms:

Input alphabet, set of states, start state, set of final states, transition function.

iii) Explain the concept of extended transition function and the language accepted by a DFA.

You might also like