Skip to content

Category Archives: GATE CS

Prerequisite: Finite Automata Introduction In this article, we will see some designing of Non-Deterministic Finite Automata (NFA).Problem-1: Construction of a minimal NFA accepting a set of… Read More
Prerequisite: Finite Automata Introduction In this article, we will see some designing of Non-Deterministic Finite Automata (NFA). Problem-1: Construction of a minimal NFA accepting a… Read More
A function is said to be Self dual if and only if its dual is equivalent to the given function, i.e., if a given function… Read More
Prerequisite: Designing finite automata In this article, we will see a designing of Deterministic Finite Automata (DFA). Problem: Construction of a minimal DFA accepting set… Read More
Prerequisite: Finite Automata Introduction In this article, we will see some designing of Non-Deterministic Finite Automata (NFA). Problem-1: Construction of a minimal NFA accepting a… Read More
This topic contains basic questions of Algorithm which can be helpful for GATE CS Preparation. So, it is recommended to solve each of these questions… 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 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
A person novice to computers often is in confusion between Random Access Memory (RAM) and Hard Disk Drive (HDD). Here we draw comparisons between the… 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

Start Your Coding Journey Now!