Theory of Computation
Closure properties of Regular languages
Closure properties on regular languages are defined as certain operations on regular language which are guaranteed to produce regular language. Closure…
August 14, 2021 · Taylor EmmaAuthor: Taylor Emma
A senior editor for The Mars that left the company to join the team of SenseCentral as a news editor and content creator. An artist by nature who enjoys video games, guitars, action figures, cooking, painting, drawing and good music.
Theory of Computation
Proving Languages not to be Regular
The pumping lemma for regular languages
August 14, 2021 · Taylor EmmaTheory of Computation
Designing Finite Automata from Regular Expression (Set 1)
In this article, we will see some popular regular expressions and how we can convert them to finite…
August 14, 2021 · Taylor EmmaTheory of Computation
Regular Sets
Any set that represents the value of the Regular Expression is called a Regular Set. Properties of Regular Sets…
August 14, 2021 · Taylor EmmaTheory of Computation
Moore and Mealy Machines
Finite automata may have outputs corresponding to each transition. There are two types of finite state machines that…
August 14, 2021 · Taylor EmmaTheory of Computation
Regular Expressions
A Regular Expression can be recursively defined as follows − · ε is a Regular Expression indicates the language containing an empty…
August 14, 2021 · Taylor EmmaTheory of Computation
DFA Minimization
DFA Minimization using Myphill-Nerode Theorem Algorithm Input − DFA Output − Minimized DFA Step 1 − Draw a table for all…
August 14, 2021 · Taylor EmmaTheory of Computation
NDFA to DFA Conversion
Problem Statement Let X = (Qx, ∑, δx, q0, Fx) be an NDFA which accepts the language L(X). We have…
August 14, 2021 · Taylor EmmaTheory of Computation
Non-deterministic Finite Automaton
In NDFA, for a particular input symbol, the machine can move to any combination of the states in…
August 14, 2021 · Taylor EmmaSoftware Testing
Deterministic Finite Automaton
Finite Automaton can be classified into two types − Deterministic Finite Automaton (DFA) Non-deterministic Finite Automaton (NDFA /…
August 14, 2021 · Taylor Emma