Web Site/Home Page (PU) Examination Notifications(PU) Seminar and Conferences(PU) Colleges List(PU) Online Apply Link(PU) Bihar National College(B.N.College)Patna Magadh Mahila College(M.M.College) Patna Patna College Patna Science College Patna Women’s College(PWC) Vanijya Mahavidyalaya Patna Patna Law College Patna Training College College of Arts and Crafts Patna Women’s Training College
Useful Common NOU Links Web Site/Home Page Admission Prospectus and Fee Structure Courses Question Papers Download Examination Process Contact Us Student Assignments & Notification1 Student Notification2 NOU Study Center List Exam Results
Useful/Popular IGNOU Links (References : www.ignou.ac.in) Web Site/Home Page Fresh Admission (Online) Identity Card Download (Online) Common IGNOU Prospectus English Fresh Admission and Study Material Status Patna Regional Center Web Site All Study Materials Download Assignments Download Question Papers Download Student Login Form (Online) Re-Registration and Study Material Status Term Read more…
Slno Books Name Author Publications 1. Introduction to the Theory of Computation Michael Sipser Cengage Learning 2. Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman Pearson / Addison-Wesley 3. Formal Languages and Automata Theory Peter Linz Jones & Bartlett Learning 4. Theory of Read more…
(List of Most Asking Interview Questions TOC or Automata Theory) Ques. : TOC stands for. Ques. : What is Automata Theory in TOC? Ques. : What is the importance of Automata Theory in TOC? Ques. : What is Regular Language in TOC? Ques. : What is Formal Language Theory in Read more…
Terminology related to TOC 1. Alphabet (Σ) It is a finite, non-empty set of symbols. For example: Σ = {a, b} 2. String It is a finite sequence of symbols from an alphabet. For example: abba 3. Language (L) It is a set of strings over an alphabet. For example: Read more…
Difference between TOC in DFA and NFA Slno Similarities 1. Both are transition functions of automata. 2. Both have same power. 3. Slno DFA NFA/NDFA 1. Stands for “Deterministic Finite Automata”. Stands for “Non-deterministic Finite Automata”. 2. No empty string transitions occurs in DFA. Empty string transitions may also possible. Read more…
Introduction Recursive Function Theory is a branch of the theory of computation that studies computable functions, that is, functions that can be calculated using a finite procedure or algorithm. It provides a mathematical foundation for understanding what problems can be solved by a computer. Definition Recursive Function Theory deals with Read more…
Introduction The concept of Chomsky Classification was developed by linguist Noam Chomsky in 1956. The Chomsky Classification is also known as the Chomsky hierarchy. Definition The Chomsky Classification is a hierarchy that categorizes grammars and languages into four types based on their generative power and computational models. The Chomsky hierarchy is a classification of Read more…