Scribd
Upload
9 views

TOC_Practical_list_Summer 2025

The document outlines a practical list for the Theory of Computation course at Vishwakarma Government Engineering College for Summer 2024. It includes tasks such as designing finite state machines, validating strings against regular expressions, and implementing algorithms for automata. Additionally, it emphasizes the use of tools like JFLAP for visualization and requires test cases for program validation.

Uploaded by

pruthvirajpasi42
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
9 views

TOC_Practical_list_Summer 2025

The document outlines a practical list for the Theory of Computation course at Vishwakarma Government Engineering College for Summer 2024. It includes tasks such as designing finite state machines, validating strings against regular expressions, and implementing algorithms for automata. Additionally, it emphasizes the use of tools like JFLAP for visualization and requires test cases for program validation.

Uploaded by

pruthvirajpasi42
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/ 1

Vishwakarma Government Engineering College, Chandkheda

Computer Science and Engineering Department (DS)


Theory of Computation (3160704)
Practical List Summer 2024

# Practical Aim
1 Design a Finite State Machine (FSM) that accepts all strings over input symbols {0, 1}
having three consecutive 1's as a substring.
2 Design a Finite State Machine (FSM) that accepts all strings over input symbols {0, 1}
which are divisible by 3.
3 Design a program to validate strings against a given regular expression.
4 Implement an algorithm to minimize a given DFA.
5 Design a Program to convert NDFA to DFA.
6 Design a Push Down Automata (PDA) that accepts all string having equal number of 0's
and 1's over input symbol {0, 1} for a language 0n1n where n >= 1.
7 Design a Program to create PDA machine that accept the well-formed parenthesis.
8 Design a PDA to accept WCWR where w is any binary string and WR is reverse of that
string and C is a special symbol.
9 Design a Turing Machine that calculate 2's complement of given binary string.
10 Design a Turing Machine which will increment the given binary number by 1.

 Use tools like JFLAP for visualizing automata and CFG.

 Provide test cases for each program to validate their correctness.

You might also like