📌Highlights: Hello Friends ! In this we explain about Rules for Constructing Arden's Equation.This post cover following such as All rules of Arden's Equation, Example of converting RE to FA by applying these rules.
Let we have any Finite Automata (FA) which follow certain rules.
1. Finite Automata does not contain ∈
Note: This is only done in DFA. If the automata is NDFA than first convert it into DFA then apply
Know how to convert NDFA to DFA
Let we understand the conversion of NDFA TO DFA.
Those finite automata which can not be determine is called NDFA.
ε is not a member of Σ (set of Input Symbol)
ε is null input or nothing.
We can not used to calculate with string because it is nothing.
εa = a
εaεε = a
εabεεc = abc
εεεaεb = ab etc.
ε gives the facility of jumping of control from one state to another without scanning any input symbol, It is just a facility.
EXAMPLE 1 :
Finite Automata are represented by a diagram called transaction diagram.
Transaction diagram are directed graph .
Those graph which have some direction are called directed graph.
Like:
AUTOMATA :Automata stands for automatic machine. A machine which operate automatically is called automatic machine.
MACHINE : Machine is a device which receive input and produce output.
