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
Dfa

# Dfa

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

### Availability:

See more
See less

03/18/2014

pdf

text

original

PRESENTED BY
SOPAN SHUKLA
2ND C.S.E.

REGULAR EXPRESSION
Regular expression can define exactly the same languages that the
various forms of automata describe: the regular languages.
Regular expression offer something that automata do not: a
declarative way to express the strings, we want to accept.
The set of regular expressions is defined by the following rules:
Let
be a given alphabet. Then
1.,
and a
are all regular expressions.These are called

primitive regular expressions.
2. If r1 and r2 are regular expressions, so are r1+r2, r1.r2 , r1* and (r1).
3. A string is a regular expression if and only if it can be derived from

the primitive regular expressions by a finite number applications of the
rules in 2.
OPERATORS OF REGULAR EXPRESSION
1. UNION : L1 U L2
It denotes the set of string that are in either L1 or L2 or both.
L1={001,10,111) and L2 ={ ,001} then L1 U L2 = { ,10,001,111}.
2. CONCATENATION:
L1.L2
It is a set of strings that can be formed by taking any string in L1
and concatenating it with any strings in L2. It is denoted by\u2018.\u2019.
3. STAR: L*

It represents a set of those strings that can be formed by taking
any number of strings from L, possibly with repetitions and
concatenating all of them.

Note : L+ represents the positive closure.