Category Archives: Theory of Computation & Automata

Prerequisite: Designing finite automata In this article, we will see some designing of Deterministic Finite Automata (DFA). Problem-1: Construction of a minimal DFA accepting a… Read More
Prerequisite: Designing finite automata In this article, we will see some designing of Deterministic Finite Automata (DFA). Problem-1: Construction of a minimal DFA accepting a… Read More
Prerequisite: Designing finite automata In this article, we will see some designing of Deterministic Finite Automata (DFA).Problem-1: Construction of a minimal DFA accepting set of strings… Read More
Prerequisite: Designing finite automata In this article, we will see some designing of Deterministic Finite Automata (DFA). Problem-1: Construction of a minimal DFA accepting set… Read More
Prerequisite: Designing finite automata In this article, we will see some designing of Deterministic Finite Automata (DFA). Problem-1: Construction of a minimal DFA accepting set… Read More
Prerequisite: Designing finite automata, Designing Deterministic Finite Automata (Set 3) In this article, we will see some designing of Deterministic Finite Automata (DFA). Problem-1: Construction… Read More
Prerequisite – Finite Automata Introduction Problem: Construct deterministic finite automata (DFA) for strings not containing consecutive two a’s and starting with a. Explanation: Accept Strings that not… Read More
Prerequisite – Pushdown automata, Pushdown Automata Acceptance by Final State  Problem: Design a non deterministic PDA for accepting the language , i.e., L = {abc, aabc,… Read More
Prerequisite – Finite Automata Introduction, DFA of a string in which 2nd symbol from RHS is ‘a’ Problem – Draw deterministic finite automata (DFA) of… Read More
Prerequisite: Designing finite automata, Designing Deterministic Finite Automata (Set 2) In this article, we will see some designing of Deterministic Finite Automata (DFA).  Problem-1: Construction of… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final stateProblem – Design a non deterministic PDA for accepting the language The strings of given language will… Read More
Prerequisite – Finite Automata Introduction Problem: Design a deterministic finite automata (DFA) for accepting the language Regular expression for above language L is, L =… Read More
Prerequisite – Pushdown automata Problem: Construct Pushdown automata for L = {0(n+m)1m2n | m, n ≥ 0} Similar PDA’s- This PDA seems to be similar… Read More
Prerequisite – Turing Machine The language L = {aibjck | i < j < k or i > j > k} ∩ {aibjck | i… Read More
Prerequisite: Designing finite automata Let’s understand the cross product operation in Deterministic Finite Automata (DFA) with help of the below example- Designing a DFA for… Read More