Category Archives: Theory of Computation

A finite state machine is a unquestionable model used to design and describe systems that have a finite add up of states, which change basedâ€¦ Read More
Automata is generally a machine that accepts the strings of a language L over an input alphabet Î£. it is the kind of machine whichâ€¦ Read More
Given the number N, the task is to count a number of ways to create a number with digit size N with the sum ofâ€¦ Read More
In the field of computer science, a technique for resolving the Boolean satisfiability problem is referred to as conflict-driven clause learning (CDCL) (SAT). The problemâ€¦ Read More
Construct a DFA for a language accepting strings of length at least two, over input alphabets Î£ = {0,1}. So that means in DFA, languageâ€¦ Read More
Construct a DFA for a language accepting strings of length at most two, over input alphabets Î£ = {0,1}. So that means in DFA, languageâ€¦ Read More
Turing Machine was first described by Alan Turing in the year 1936. It was primarily invented to investigate the computability of a given problem. Itâ€¦ Read More
Both computabilities, as well as decidability, tells us about the existence of an algorithm for a particular problem or function, while solving a particular problemâ€¦ Read More
A Pushdown Automata (PDA) is a way to implement context-free Grammar in a similar way. We design Finite Automata for Regular Grammar. It is moreâ€¦ Read More
As the regular expressions can be constructed from Finite Automata using the State Elimination Method, the reverse method, state decomposition method can be used toâ€¦ Read More
Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = {aNbM | N â‰¥ 0,â€¦ Read More
Prerequisite: Designing Finite Automata DFA (Deterministic Finite Automata or Acceptor) is a finite state machine that accepts or rejects strings of symbols. DFA accepts theâ€¦ Read More
Prerequisites: Introduction of Pushdown Automata Construct Pushdown Automata for given languages Problem– Construct PDA for the language L = {anba2n | n â‰¥ 0}.  Thisâ€¦ Read More
1. Computational complexity :Computational complexity, a measure of the number of computing resources(time and space) that a particular algorithm consumes when it runs. The timeâ€¦ Read More
Minimization of DFA using Myhill-Nerode Theorem :Minimization of DFA is Required to obtain the minimal and equivalent version of any DFA which consists of minimumâ€¦ Read More