Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Arden’s Theorem (Tafl)

Arden’s Theorem (Tafl)

Ratings: (0)|Views: 80|Likes:

Availability:

See more
See less

05/09/2014

pdf

text

original

Presentation on :
Presentation on :
\ue000Presented by:-
Presented b
y:-
Gaurav Gupta
Gaurav Gupta
20/05
20/05
IInd B.Tech I.T.
IInd B.Tech I.T.
\u201c
\u201cARDEN\u2019S
ARDEN\u2019S
THEOREM\u201d
THEOREM\u201d
CONSRTRUCTION OF
CONSRTRUCTION OF
REGULAR EXPRESSION
REGULAR EXPRESSION
FROM DFA
FROM DFA
\ue000The regular expression is mathematical
The regular expression is mathematical
expression for a given regular language.
expression for a given regular language.
\ue000We know that for every regular language there
We know that for every regular language there
exist a DFA.
exist a DFA.
\ue000We can conclude that for regular expression,
We can conclude that for regular expression,
regular language for that regular expression
regular language for that regular expression
and DFA for that regular language are similar
and DFA for that regular language are similar
things in different representation.
things in different representation.
\ue000So we can construct regular expression for
So we can construct regular expression for
every Deterministic Automata.
every Deterministic Automata.
\ue000ARDEN\u2019S THEOREM
ARDEN\u2019S THEOREM is one means to implement
is one means to implement
it.
it.
Let P and Q be two regular expression
Let P and Q be two regular expression
over alphabet
over alphabet\u03a3
\u03a3. If P does not contain
. If P does not contain
NULL STRING (
NULL STRING (\u03b5
\u03b5), then :
), then :
R = Q + RP
R = Q + RP
Has a
Has a unique solution
uni
que solution that is :
that is :
R = QP*
R = QP*
Now lets have a look at its mathematical
Now lets have a look at its mathematical
proof\u2026
proof\u2026