Skip to content

Latest commit

 

History

History
22 lines (18 loc) · 764 Bytes

File metadata and controls

22 lines (18 loc) · 764 Bytes

Theory-of-Machines-and-Languages

Table of Contents

Introduction

This project deal with diverse automatas like: DFA and NFA. At first implementation, we take an input from user and determine whether is it acceptable in DFA or not. At second implementation, we convert a NFA to a DFA.

Technologies

Project is created with:

  • Python version: 3.7

Setup

To run this project, use below commands:

$ python3 q1.py
$ python3 q2.py