meta data for this page
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
public:dugc:cs208-toc [2015/07/08 15:46] – anupreet | public:dugc:cs208-toc [2020/06/05 02:36] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 26: | Line 26: | ||
I Title of the Course | I Title of the Course | ||
- | i | + | i |
- | ____________________ | + | L |
+ | | ||
ii Prerequisite, | ii Prerequisite, | ||
Line 82: | Line 83: | ||
Press, 2004. | Press, 2004. | ||
- | --------------- | + | ---- |
Once this course is introduced, CS 208 - Automata Theory and Logic can be | Once this course is introduced, CS 208 - Automata Theory and Logic can be | ||
renamed " | renamed " | ||
Line 98: | Line 100: | ||
Current curriculum: | Current curriculum: | ||
- | I Title of the Course | + | I Title of the Course |
- | | + | |
- | | + | |
- | | + | |
- | | + | |
- | | + | |
- | v | + | v |
Rudiments of formal languages. Finite state machines(DFA/ | Rudiments of formal languages. Finite state machines(DFA/ | ||
enumerability, | enumerability, | ||
- | Texts/ | + | Texts/ |
- | 1. Introduction to Automata Theory, Languages and Computation, | + | 1. Introduction to Automata Theory, Languages and Computation, |
- | by John. E. Hopcroft, Rajeev Motwani, J. D. Ullman, | + | by John. E. Hopcroft, Rajeev Motwani, J. D. Ullman,\\ |
published by Pearson Education Asia, 2006.\\ | published by Pearson Education Asia, 2006.\\ | ||
- | 2. Elements of the Theory of Computation, | + | 2. Elements of the Theory of Computation, |
published by Prentice Hall Inc, 1981. | published by Prentice Hall Inc, 1981. | ||