Skip to content

Category Archives: Theory of Computation & Automata

Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we will see some designing of Finite Automata with Output i.e,… Read More
Prerequisite: Finite automata, Regular expressions, grammar and language. Designing finite automata from Regular expression In the below article, we shall see some Designing of Finite… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we shall see a conversion of Moore to Mealy machine-  State… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we shall see a conversion of Moore to Mealy machine-  State… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we will see some designing of Finite Automata with Output… Read More
Prerequisite – Undecidability, Decidable and undecidable problems Identifying languages (or problems*) as decidable, undecidable or partially decidable is a very common question in GATE. With correct… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we will see some designing of Finite Automata with Output… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we will see some designing of Finite Automata with Output,… 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
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we shall see a conversion of Moore to Mealy machine-… 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 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
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
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

Start Your Coding Journey Now!