Introduction The Turing Machine (TM) was proposed by Alan Turing (1936). Definition A Turing Machine is an abstract machine or theoretical computational model that manipulates symbols on an infinite tape according to a set of rules. A Turing Machine is defined in a 7-tuple form: M=(Q,Σ,Γ,δ,q0,B,F) where, Q = Finite set of Read more…
Introduction A Push-Down Automata (PDA) is a type of automaton (abstract machine) used in the theory of computation. Definition Pushdown automata are an abstract computational model that uses a stack to recognize context-free languages. A Push-Down Automaton is a finite automaton with a stack that allows push and pop operations Read more…
Introduction A Context-Free Grammar (CFG) is a formal system that provides a precise way to define valid strings in a language. Definition A Context-Free Grammar (CFG) is a formal grammar used to define context-free languages, where each production rule has a single non-terminal on the left-hand side. A language is Read more…
Introduction The Pumping Lemma states that every regular language has a pumping length such that sufficiently long strings can be decomposed and repeated while remaining in the language. Definition The Pumping Lemma is a powerful theoretical tool that helps identify the limitations of finite automata and distinguish regular languages from Read more…
Introduction A language is regular if and only if it can be accepted by a finite automaton. Finite Automata (FA) is the simplest computational model/abstract machine in the Theory of Computation (TOC). Finite Automata form TOC’s base, and are extended by Pushdown Automata (for context-free languages) and Turing Machines. Definition Read more…
Regular Language(RL) A regular language is any set of strings over a finite alphabet (Σ) that can be accepted or recognized by a finite automaton (DFA or NFA). Regular languages are the simplest class of languages in the Chomsky hierarchy of formal languages, a concept within the Theory of Computation Read more…
History The concept and roots of TOC originated in the 1930s/early 20th century during the “Crisis in Foundations of Mathematics,” when pioneering logicians like Kurt Gödel, Alonzo Church, and Alan Turing independently tackled Hilbert’s Entscheidungsproblem (decision problem). Modern TOC started in the 1970s. Introduction The Theory of Computation or Theory Read more…
Slno Books Name Publications Author/Writer 1. Artificial Intelligence TMH E.Rich & K. Knight 2. Introduction to Artificial Intelligence Pearson E. Charnaik 3. Introduction to Artificial Intelligence & Expert Systems PHI Dan. W. Patterson 4. Principle of Artificial Intelligence Narosa Publication Nils J. Nilson 5. Artificial Intelligence Pearson Luger
SlNo Book's Name Author's Name Publications 01. Fundamentals of Computer Algorithm Ellis Horowitz And Sartaj Sawhney — 02. Introduction to Algorithms Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. PHI Publications. 03. Algorithms Robert Sedgewick and Kevin Wayne Addison Wesley 04. Introduction to Algorithms: A Creative Read more…
Hash Algorithm : Hash Algorithm is a Hash function that takes a string of any length and decreases it to a unique fixed length string. It is used for password validity, message & data integrity and for many other cryptographic systems. A Hash table is (related to a Hash Function) Read more…