Posted inFeatured
Posted inTheory of Computation
Proving Languages not to be Regular
The pumping lemma for regular languages
Posted inTheory 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…
Posted inTheory of Computation
Regular Sets
Any set that represents the value of the Regular Expression is called a Regular Set. Properties…
Posted inTheory of Computation
Moore and Mealy Machines
Finite automata may have outputs corresponding to each transition. There are two types of finite…
Posted inTheory of Computation
Regular Expressions
A Regular Expression can be recursively defined as follows โ ยท ฮต is a Regular Expression indicates the language…
Posted inTheory of Computation
DFA Minimization
DFA Minimization using Myphill-Nerode Theorem Algorithm Input โ DFA Output โ Minimized DFA Step 1 โ Draw a…
Posted inTheory of Computation
NDFA to DFA Conversion
Problem Statement Let X = (Qx, โ, ฮดx, q0, Fx) be an NDFA which accepts the language…
Posted inTheory of Computation
Non-deterministic Finite Automaton
In NDFA, for a particular input symbol, the machine can move to any combination of…
Posted inSoftware Testing
Deterministic Finite Automaton
Finite Automaton can be classified into two types โ Deterministic Finite Automaton (DFA)Non-deterministic Finite Automaton…
Posted inTheory of Computation
Automata Theory
Automata โ What is it? The term "Automata" is derived from the Greek word "ฮฑแฝฯฯฮผฮฑฯฮฑ"…