Skip to content

Category Archives: Theory of Computation & Automata

Prerequisite – Finite automata, L-graphs and what they represent L-graphs can generate context sensitive languages, but it’s much harder to program a context sensitive language… Read More
Prerequisite – Finite automata introduction All programming languages can be represented as a finite automata. C, Paskal, Haskell, C++, all of them have a specific… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language L = {| m,n ≥… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – Design a non deterministic PDA for accepting the language L = {| m,n… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Pushdown automata (PDA) plays a significant role in compiler design. Therefore there is a need… Read More
Design a deterministic finite automata(DFA) for accepting the language L =For creating DFA for language, L = { a^n b^m ; n+m=even } use elementary… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language L = { |… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – Design a non deterministic PDA for accepting the language L = {[Tex]b^{2m}   [/Tex]: m>=1},… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – Design a non deterministic PDA for accepting the language L = {[Tex]b^n  [/Tex]| n>=1},… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language L = { |… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – – Design a non deterministic PDA for accepting the language L = {[Tex]b^m  [/Tex]|… Read More
Prerequisite – Designing finite automata Designing a DFA for the set of string over {a, b} such that string of the language start with “a” and… Read More
Prerequisite – Designing finite automata Let’s understand the Union process in Deterministic Finite Automata (DFA) with the help of below example. Designing a DFA for… Read More
Prerequisite – Designing finite automata, previous article: Designing Deterministic Finite Automata (Set 1) In this article, we will see some designing of Deterministic Finite Automata… Read More
Prerequisite – Designing finite automata In this article, we will see some designing of Deterministic Finite Automata (DFA).  Problem-1: Construction of a DFA for the… Read More

Start Your Coding Journey Now!