Prerequisite: Finite automata, Regular expressions, grammar and language, Designing finite automata from Regular expression (Set 4) In the below article, we shall see some Designing… Read More
Category Archives: Theory of Computation
Prerequisite: Finite automata, Regular expressions, grammar and language, Designing finite automata from Regular expression (Set 3) In the below article, we shall see some Designing… Read More
Prerequisite: Finite automata, Regular expressions, grammar and language, Designing finite automata from Regular expression (Set 2) In the below article, we shall see some Designing… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine Problem: Construction of the machines that take set of all string over {a,… Read More
Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine Problem: Construction of the machines that take set of all string over {0, 1}… Read More
These questions for practice purpose for GATE CS Exam. Ques-1: Consider the following two statements with respect to Countability: Statement-1: If X union of ‘Y’… 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 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
These questions for practice purpose for GATE CS Exam. Ques-1: Consider L= {(TM) | TM is the Turing machine that halts on all input and… 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
