# Category Archives: Theory of Computation & Automata

Turing Machine : Alan Mathison Turing proposed the Turing machine in 1936, a computer model capable of simulating all computational behaviors. A Turing machine is… Read More
The Boyer-Moore voting algorithm is one of the popular optimal algorithms which is used to find the majority element among the given elements that have… Read More
A half clique in a graph is a set of n/2 vertices such that each vertex shares an edge with every other vertex, that is,… Read More
Prerequisites : Context Free Grammars , Ambiguous Grammar, Difference between ambiguous and unambiguous grammar, Precedence and Associativity of operators, Recursive GrammarIn this article we are… Read More
Noam Chomsky has divided grammar into four types : Type Name 0 Unrestricted Grammar 1 Context Sensitive Grammar 2 Context Free Grammar 3 Regular Grammar… Read More
Given a string S that represents an integer, the task is to check if the given string S represents an unsigned integer or not by… Read More
History :In 1960, associate degree automaton model was introduced by Myhill and these days this automation model is understood as deterministic linear bounded automaton. After… Read More
Regular grammar is a type of grammar that describes a regular language. A regular grammar is a mathematical object, G, which consists of four components,… Read More
Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = C (A + B)+. If… Read More
Prerequisite – Theory of Computation Grammar :It is a finite set of formal rules for generating syntactically correct sentences or meaningful correct sentences. Constitute Of… Read More
Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are a few special rules for construction… Read More
Prerequisite: Finite Automata Given a string S of size N, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L… Read More
Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are a few special rules for construction… Read More
Given a binary string S, the task is to write a program for DFA Machine that accepts a set of all strings over w ∈… Read More
Prerequisite – Turing Machine Task : Our task is to design a Turing Machine for an equal number of a’s and b’s. Analysis : Here… Read More