Scribd
Upload
822 views

TOC Practical Front Page and Index

This document appears to be a practical file submitted by a student named Aashutosh Tiwari for their Theory of Computation course. It contains an index listing 12 programming assignments completed as part of the course, including designing machines to accept or recognize certain types of strings and languages. The assignments cover topics like finite automata, pushdown automata, Turing machines, and binary/decimal number representations. The file was submitted to professors Mahesh Parmar and Sneha Garg.

Uploaded by

Aashutosh Tiwari
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
822 views

TOC Practical Front Page and Index

This document appears to be a practical file submitted by a student named Aashutosh Tiwari for their Theory of Computation course. It contains an index listing 12 programming assignments completed as part of the course, including designing machines to accept or recognize certain types of strings and languages. The assignments cover topics like finite automata, pushdown automata, Turing machines, and binary/decimal number representations. The file was submitted to professors Mahesh Parmar and Sneha Garg.

Uploaded by

Aashutosh Tiwari
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

MADHAV INSTITUTE OF TECHNOLOGY &

SCIENCE GWALIOR, M.P. - 474005


(A Govt. Aided UGC Autonomous Institute, Affiliated to RGPV Bhopal)

Practical File
on
Theory Of Computation(150503)
July-December, 2019

Submitted to: Submitted by:

Prof. Mahesh Parmar Aashutosh Tiwari (0901CS171002)


Prof. Sneha Garg CSE-3rd Year
INDEX

S.No. Name of Program Date of Submission Faculty’s Signature


1 Design a program for creating a machine
that accept three consecutive ones.

2 Design a program for creating machine


that accept the string always ending with
101.
3 Design a program for mod 3 machine.

4 Design a program for accepting decimal


number divisible by 2.

5 Design a machine for machine that accept


string equal number of 0’s and 1’s.

6 Design a machine to count number of 1’s


and 0’s in input string.

7 Design a program to find 2’s complement of


a given binary number.

8 Design a program which will increment the


given number by 1.

9 Design a program to convert NFA to DFA.

10 Design a program to create PDA machine


that accept the well-formed parenthesis.

11 Design a PDA to accept WCWR where W is


a string and WR is reverse of it and C is a
special character.

12 Design a Turing Machine that accept the


following language anbncn where n>0.
INDEX

S.No. Name of Program Date of Submission Faculty’s Signature

You might also like