📘 Access 10,000+ CBC Exams With Marking Schemes

Prepare your learners for success! Get CBC-aligned exams for Grades 1–9, PP1–PP2, Playgroup and High School - all with marking schemes.

Browse Exams

Instant download • Trusted by 100,000+ teachers • Updated weekly

Comp 303:Computing Theory Question Paper

Comp 303:Computing Theory 

Course:Bachelor Of Science In Computer Technology

Institution: Egerton University question papers

Exam Year:2011



The course Outline: Introduction to the Theory of Computation
T
1. Mathematical preliminaries;
2. Regular languages, finite automata, and regular expressions;
3. Nondeterminism and determinism in finite automata;
4. Properties of regular languages;
5. Nonregular languages;
6. Context-free languages, context-free grammars, and pushdown automata;
7. Nondeterminism and determinism in pushdown automata;
8. Properties of context-free languages;
9. Non-context-free languages;
10. Multi-stack machines;
11. Rcursively-enumerable languages and Turing machines;
12. Recursive and nonrecursive languages;
13. Reductions.





More Question Papers

Enhance your teaching with our comprehensive Schemes of Work and Notes!

Exams With Marking Schemes

End Term 3 Exams

Mid Term Exams

End Term 1 Exams

Opener Exams

Full Set Exams

Return to Question Papers    

© 2008-2025 by Lexplex Group. All Rights Reserved | Home | About Us | Contact Us | Copyright | Terms Of Use | Privacy Policy | Advertise | Affiliates