# Category Archives: Theory of Computation

Prerequisite – Regular Grammar, Regular Expressions, Chomsky hierarchy Overview :In this article, we will discuss the overview of Regular Grammar can be either Right Linear… Read More
In this article, we will discuss how you can solve the problem, and also you will see how you can design problems related to DFA… Read More
In this article, we will discuss the DFA in LEX Code which accepts a string containing the third-last element ‘a’ over input alphabet {a, b}… Read More
An Automaton is a machine that has a finite number of states. Any Two Automaton is said to be equivalent if both accept exactly the… Read More
Prerequisites: Chomsky hierarchy Type-3 grammar/regular grammar: Regular grammar generates regular language. They have a single non-terminal on the left-hand side and a right-hand side consisting… Read More
The Below Table shows the Closure Properties of Formal Languages : REG = Regular LanguageDCFL = deterministic context-free languages, CFL = context-free languages,CSL = context-sensitive languages,RC… Read More
Prerequisite : NP-Completeness Real-world Applications of constructive  P=NP  proof :The polynomial class of problems, also known as P, are solvable in polynomial time. However, the… Read More
Introduction :Parikh’s theorem in theoretical computer science says that if one looks only at the number of occurrences of each terminal symbol in a context-free… Read More
Transducers in Finite Automata(FA) means FA with Output.There are two types of Machines for FA with Output. 1. Mealy Machine : It is FA in which… Read More
Regular expressions : It is a way of representing regular languages. The algebraic description for regular languages is done using regular expressions. They can define… Read More
Overview :According to the theoretical aspects of Automata, a quotient operation can be defined as the technique that recognizes a superset of the given automation… Read More
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