Electronicsad communication engineeringFull description
descriptionFull description
Antenna ans wave propagation for 6th sem ece an important theorem in unit 1
Bandwidth TheoremFull description
nmn
Bayes Theorem
Simple example of Chinese Remainder TheoremFull description
Circuits ExperimentFull description
Specimen copy of Resonance Distance Learning program for JEE-Main. Visit @ www.edushoppee.resonance.ac.in to purchase.
Full description
From wikipediaFull description
convolution theorem
Specimen copy of Resonance Distance Learning program for JEE-Main. Visit @ www.edushoppee.com to purchase.Full description
Generally it has been noticed that differential equation is solved typically. The Laplace transformation makes it easy to solve. The Laplace transformation is applied in different areas of science, engineering and technology. The Laplace transformati
Full description
Full description
verification of Bernoulli’s theorem using Bernoulli’s theorem apparatus
Full description
El Teorema de Okishio: su discusión en Japón y la evidencia empírica que lo respalda, de Sousuke Morimoto, 1983.
elcitwoFull description
Superposition Theorem ppt
Specimen copy of Resonance Distance Learning program for JEE-Main. Visit @ www.edushoppee.resonance.ac.in to purchase.
Presentation on :
“ARDEN’S THEOREM”
Presented by:Gaurav Gupta 20/05 IInd B.Tech I.T.
CONSRTRUCTION OF REGULAR EXPRESSION FROM DFA
The regular expression is mathematical expression for a given regular language. We know that for every regular language there exist a DFA. We can conclude that for regular expression, regular language for that regular expression and DFA for that regular language are similar things in different representation. So we can construct regular expression for every Deterministic Automata. ARDEN’S THEOREM is one means to implement it.
AR DEN’S TH EO REM Let P and Q be two regular expression over alphabet Σ. If P does not contain NULL STRING (ε), then : R = Q + RP Has a unique solution that is : R = QP* Now lets have a look at its mathematical proof…
MATHEMATICAL PROOF It can be understood as : R = Q + RP Put the value of R in R.H.S. R = Q + (Q + RP) P = Q +QP + RP2 When we put the value of R again and again we get the following equation: R = Q + QP + QP2 + QP3… R = Q ( 1 + P + P2 + P3 …) R = Q ( ε + P + P2 + P3 … )
R = QP* -(By the definition of closure operation for regular expression.)
IMPLEMENTATION : USE OF ARDEN’S THEOREM TO FIND REGULAR EXPRESSION OF A DFA : There are certain assumptions which are made regarding the transition system : The transition diagram should not have εtransition. It must have only a single initial state. Its vertices are q1 , q2 , … , qn .
Contd… wij denotes the regular expression representing the set of labels of edges from qi to qj .We can get the following set of equation in q1 … qn . q1 = q1 w11 + q2 w21 + … + qn wn1 + ε (since q1 is the initial state) q2 = q2 w12 + q2 w22 + … + qn wn2 : : qn = q1 w1n + q2 w2n + … + qn wnn We solve these equations for qi in terms wij‘s and it will be the required
EXAMPLE # 1 : QUES: Find the regular expression for transition diagram given below a: q1
q2 b
a
b
q3
a
b
q4
a,b
SOLUTION # 1 : Form the eqns.
a q1
q2 b
q1 = q2 b + q3 a + b
a
ε
-eqn(i) q3
a
b
q4
a,b
SOLUTION # 1 : Form the eqns. q1 = q2 b + q3 a + ε
a q1 b a
b
-eqn(i)
q2 = q1 a -eqn(ii)
q2
q3
a
b
q4
a,b
SOLUTION # 1 : Form the eqns. q1 = q2 b + q3 a + ε
a q1 b a
b
q3
-eqn(i)
q2 = q1 a (ii)
-eqn
q2
a
b
q4
SOLUTION # 1 : Form the eqns. q1 = q2 b + q3 a + ε -
a q1
q2
(i)
q2 = q1 a
–
q3 = q1 b
–
(ii)
(iii)
b a
b
q3
q4 = q2 a + q3 b + q4 a + q4 b -eqn(iv)
a
b
q4
a,b
SOLUTION # 1 : Form the eqns. q1 = q2 b + q3 a + ε –(i) q2 = q1 a –(ii) q3 = q1 b –(iii) q4 = q2 a + q3 b + q4 a + q4 b
a q1
q2 b
a
b
a
–(iv)
Put q2 and q3 in q1 as : q1 = q1 ab + q1 ba + ε q1 = ε + q1 (ab + ba) q1 = ε (ab + ba)*
q3
b
q4
a,b
So required regular expression is : (ab + ba)*
EXAMPLE # 2 : QUES: Construct a regular expression corresponding to the state 0 diagram: 1