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…
Language(L) A language is the set of all the strings of length exactly they have over a finite alphabet (Σ). A language is strings with grammar. Alphabets used in a language may be English, Hindi, or others. A language includes – Alphabets(Σ) : The collection of symbols or strings. Alphabet 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…
Ques. : What is an algorithm in computing? Ques. : What is the need of Algorithm? Ques. : What are the features of a good algorithm? Ques. : How an algorithm is different from Flowchart? Ques. : What are the demerits of Algorithm? Ques. : What is Complexity? What is Read more…
Difference between Algorithm and Flowchart Slno. Algorithm Flowchart 01. A method of representing thestep-by-step logical procedure for solving a problem. Flowchart is pictorial representation of an algorithm. It is constructed using different types of boxes and symbols. 02. It describes step-by-stepdescriptions and each step represents a particular operation leading to Read more…
Analysis of Algorithm The field of computer science, which studies efficiency of algorithms, is known as analysis of algorithms. The time and space used by the algorithm(M) are the two main measures for the efficiency of an algorithm. The analysis of algorithms can be evaluated by a variety of criteria. Read more…
Link for Complexity Notations Complexity of Algorithm Introduction Complexity simply means difficulties in a process. Definition Algorithm complexity is a measure of the resources required by an algorithm as a function of input size to solve a problem. The two main resources are time (how long the algorithm takes to run) and space (how Read more…