Formal Languages: Four classes of grammars (Phrase Structure, context sensitive, context free,
regular)-Finite State Automata- Non-Deterministic Finite State Automata (NFSA), conversion of
NDFSA to DFSA- acceptance of regular set by an FSA- construction of a right linear grammar
from a finite automata. |
1. Kishore.S, Trivedi, “Probability and statistics with reliability, queuing and computer Science
applications, PHI Edition,2000 (UNIT-1)
2. Kandasamy.P, Thilagavathy.K and Gunavathi.K, “Numerical methods(revised edition)
S.Chand company, New Delhi 2003 (UNIT 2)
3 Taha H.A.,“Operations Research : An Introduction “7th Edition, Pearson Education,
2004. (UNIT-3,4)
4. Hopcroft and Ullman, “Introduction to Automata Theory, Languages and
Computation”, Narosa Publishing House, Delhi, 2002. ( Unit 5) |