Non-Linear: Random Order
This course is intended to introduce the computer science students to the Finite Automata, Grammers, Pushdown Automata, Turning Machines and Unsolvable Problems and Computable Functions
1. Understand various Computing models like Finite State Machine, Pushdown Automata, and Turing Machine.
2. Be aware of Decidability and Un-decidability of various problems.
3. Learn types of grammars.
4. Data Visualisation skills
5. Good communication skills.
There is no particular prerequisite to learn Theory of Computation, you will be able to do very well, if you have these basic skills:
1. Basic Knowledge in programming
2. Good Computer Knowledge
3. Good communication skills.
.The certificate issued for the Course will have the student's Name, Photograph, Course Title, Certificate number, Date of course completion and the name(s) and logo(s) of the Certifying Bodies. Only the e-certificate will be made available. No Hard copies. The certificates issued by uLektz Learning Solutions Pvt. Ltd. can be e-verifiable at www.ulektzskills.com/verify.