## NPDA for accepting the language L = {ambncn | m,n ≥ 1}

Prerequisite – Pushdown automata, Pushdown Automata Acceptance by Final State Problem: Design a non deterministic PDA for accepting the language , i.e., L = {abc,… Read More »

## DFA of a string in which 3rd symbol from RHS is ‘a’

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 »

## TOC | Designing Deterministic Finite Automata (Set 3)

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… Read More »

## NPDA for accepting the language L = {a(m+n)bmcn | m,n ≥ 1}

Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language The strings of given… Read More »

## Program to construct a DFA which accept the language L = {anbm | n mod 2=0, m≥1}

Prerequisite – Finite Automata Introduction Problem: Design a deterministic finite automata (DFA) for accepting the language Regular expression for above langauge L is, L =… Read More »

## Construct Pushdown automata for L = {0(n+m)1m2n | m, n ≥ 0}

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 »

## Construct a Turing Machine for a language L = {aibjck | i<j<k or i>j>k} ∩ {aibjck | i>j>k or i>j>k}

Prerequisite – Turing Machine The language L = {aibjck | i < j < k or i > j > k} ∩ {aibjck | i… Read More »

## TOC | Cross Product Operation in DFA

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 »

## Construct Pushdown automata for L = {0m1(n+m)2n | m,n ≥ 0}

Prerequisite – Pushdown automata, NPDA for accepting the language L = {amb(n+m)cm | m, n >= 1} Problem: Construct Pushdown automata for L = {0m1(n+m)2n… Read More »

## DFA for accepting the language L = {an bm | n+m=odd}

Design a deterministic finite automata (DFA) for accepting the language For creating DFA for language L = {an bm | n+m=odd} use elementary mathematics which… Read More »

## NPDA for accepting the language L = {anbm | n,m ≥ 1 and n ≠ m}

Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language , i.e., L =… Read More »

## Construct a Turing machine for L = {aibjck | i < j < k or i > j > k}

Prerequisite – Turing Machine The language L = {aibjck | i < j < k or i > j > k} is same as the… Read More »

## Construct a Turing machine for L = {aibjck | i< j< k; i ≥ 1}

Prerequisite – Turing Machine In given language L = {aibjck | i< j< k; i≥ 1}, every string of ‘a’, ‘b’ and ‘c’ have certain… Read More »

## Construct a Turing machine for L = {aibjck | i>j>k; k ≥ 1}

Prerequisite – Turing Machine In given language L = {aibjck | i>j>k; k ≥ 1}, every string of ‘a’, ‘b’ and ‘c’ have certain number… Read More »

## TOC | Turing Machine as Comparator

Prerequisite – Turing Machine Problem : Draw a turing machine which compare two numbers. Using unary format to represent the number. For example, 4 is… Read More »