There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
Second part of Theory of Languages and Automata course final project in which we implement a program that get some binary input, find its equivalent Turing machine. Later we get some input again and check whether Turing machine accepts these inputs or not.
