Metadata-Version: 2.4
Name: theory_of_computation
Version: 1.0.1
Summary: A package for DFA and Turing Machine implementations.
Author: Mohamed Abdelmabod
Author-email: mohamedabdlmabod03@gmail.com
Classifier: Programming Language :: Python :: 3
Requires-Python: >=3.6
Description-Content-Type: text/markdown
License-File: LICENSE
Requires-Dist: colorama
Dynamic: author
Dynamic: author-email
Dynamic: classifier
Dynamic: description
Dynamic: description-content-type
Dynamic: license-file
Dynamic: requires-dist
Dynamic: requires-python
Dynamic: summary

# Theory of Computation Practical


### The package is designed to solve two main tasks:

- **DFA for Substring '101'**: A Deterministic Finite Automaton (DFA) designed to check if a binary string contains the substring "101".
---

- **Turing Machine for Divisibility by 3**: A Turing Machine that determines if a binary number is divisible by 3.



