# Category Archives: Theory of Computation & Automata

Prerequisite – Finite Automata (FA) Compound FA is the resultant DFA formed after performing operation (∪, ∩, -) on given DFAs D1 and D2. D1… Read More
A standard Turing Machine is a machine which on providing an input moves either to the left or right and it may overwrite the existing… Read More
Regular Expressions are capable of describing the syntax of Tokens. Any syntactic construct that can be described by Regular Expression can also be described by… 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, Designing Finite Automata from Regular Expression (Set 1) ∈-NFA is similar to the NFA but have minor difference by epsilon… Read More
Prerequisite: Finite automata, Regular expressions, grammar and language, Designing finite automata from Regular expression (Set 7) 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 6) 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 {0, 1}… Read More
Prerequisite: Finite automata, Regular expressions, grammar and language, Designing finite automata from Regular expression (Set 5) In the below article, we shall see some Designing… 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 (Set 4)  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 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