Scribd
Upload
164 views6 pages

Re and Finite Automata Examples

1. This document defines key concepts related to formal languages, including alphabets, languages, regular expressions, and finite state automata (FSA). 2. A regular expression is a pattern that generates the strings of a desired language using operations like concatenation, repetition, and choice. There is a one-to-one correspondence between regular expressions and FSAs. 3. An FSA is a model of computation with a finite number of states, transitions between states, a start state, accept states, and a transition function. It can recognize languages by reading input strings and transitioning between states.

Uploaded by

hhh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
164 views6 pages

Re and Finite Automata Examples

1. This document defines key concepts related to formal languages, including alphabets, languages, regular expressions, and finite state automata (FSA). 2. A regular expression is a pattern that generates the strings of a desired language using operations like concatenation, repetition, and choice. There is a one-to-one correspondence between regular expressions and FSAs. 3. An FSA is a model of computation with a finite number of states, transitions between states, a start state, accept states, and a transition function. It can recognize languages by reading input strings and transitioning between states.

Uploaded by

hhh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

1.

0 Languages, Expressions, Automata

Alphabet: a finite set, typically a set of symbols.


Language: a particular subset of the strings that can be made from the alphabet.

ex: an alphabet of digits = {-,0,1,2,3,4,5,6,7,8,9}


a language of integers = {0,1,2,...,101,102,103,...,-1,-2,etc.}
Note that strings such as 2-20 would not be included in this language.

Regular Expression:
A pattern that generates (only) the strings of a desired language. It is made up of
letters of the language’s alphabet, as well as of the following special characters:

( ) used for grouping


( repetition
C concatenation (usually omitted)
+ denotes a choice (“or”).
ë a special symbol denoting the null string
Precedence from highest to lowest: () ( C +

formal (recursive) definition:


If A is an alphabet, and a 0 A , then a is a regular expression.
ë is a regular expression.
If r and s are regular expressions, then the following are also regular
expressions: r* , r C s = rs , r + s , and ( r )

examples: (assume that A = {a, b} )

a C b C a (or just aba ) matched only by the string aba


ab + ba matched by exactly two strings: ab and ba
b* matched by { ë, b, bb, bbb, ....}
b(a + ba*)*a (b + ë) matched by bbaaab, and many others

Some convenient extensions to regular expression notation:

aa = a2, bbbb = b4, etc.


a+ = aCa* = { any string of a's of positive length, i.e. excludes ë }
ex: (ab)2 = abab … a2 b2 , so don't try to use "algebra”.
ex: (a+b)2 = (a+b)(a+b) = aa or ab or ba or bb.
ex: (a+b)* any string made up of a’s and b’s.

1.0 Languages, Expressions, Automata 1


Examples of regular expressions over {a, b} :

C all strings that begin with a and end with b


a (a + b)* b

C all non empty strings of even length


(aa + ab + ba + bb)+

C all strings with at least one a


(a + b)* a (a + b)*

C all strings with at least two a's


(a + b)* a (a + b)* a (a + b)*

C all strings of one or more b's with an optional single leading a


(a + ë) b+

C the language { ab, ba, abaa, bbb }


ab + ba + abaa + bbb or
ab (ë + aa) + b (a + bb) or
(a + bb) b + (b + aba) a or?
Tips:
Check the simplest cases
Check for “sins of omission” (forgot some strings)
Check for “sins of commission” (included some unwanted strings)

More examples

Find a regular expression for the following sets of strings on { a, b }:

C All strings with at least two b’s.


(a + b)* b (a + b)* b (a + b)*
C All strings with exactly two b’s.
a* b a* b a*
C All strings with at least one a and at least one b.
(a + b)* (ab + ba) (a + b)*
C All strings which end in a double letter (two a’s or two b’s).
(a + b)* (aa + bb)
C All strings of even length (includes 0 length).
(aa + bb + ab + ba)*

1.0 Languages, Expressions, Automata 2


Finite Automata: a particular, simplified model of a computing machine, that is a
“language recognizer”:

yes

text
“recognizer” no
aaba

A finite automaton (FSA) has five pieces:

1. S = a finite number of states,


2. A = the alphabet,
3. Si = the start state,
4. Y = one or more final or “accept” states, and
5. F = a transition function (mapping) between states, F: S x A º S.

The transition function F is usually presented in one of two ways:

• as a table (called a transition table), or


• as a graph (called a transition diagram).

Transition Table (example):


A= { a, b }, S = { s0 , s1 , s2 }, Si = s1, Y = { s0 , s2 }

current input F a b
s0 s0 s2
current
s1 s1 s0
state
s2 s0 s0
gives the next state <

1.0 Languages, Expressions, Automata 3


Transition Diagram (example):

Note that this FSA is:

• Complete
(no undefined
transitions)

• Deterministic
(no choices)

“Skeleton Method” - a useful solution technique in limited cases:

• The “skeleton” is a sequence of states assuming legal input.


• Construct the skeleton, presume that no additional states will be needed.
• The FSA must be complete and deterministic: for A= { a,b }, every state
has exactly two arcs leaving it, one labeled “a” and one labeled “b”.

example (skeleton): All strings containing abaa

1.0 Languages, Expressions, Automata 4


Examples
Assume A= { a, b }. Construct the following automata which:

1. Accepts strings of the form (a+b)*

start s0 a, b

2. Accepts ë only.

a, b a, b
start s1
s0

3. Accepts strings which begin with a

a a, b
start s1
s0

s0 start b
s1 a found at begin. s2 a, b
s2 starting b

4. Accepts strings containing ‘aa’ (skeleton method)

a a a, b
start s0 s1 s2

b
b

1.0 Languages, Expressions, Automata 5


5. All words containing at least two a's

a a a, b
start s0 s1 s2

b b

4. All words containing exactly two a's

a a b
start s0 s1 s2

b b a

s0 no ‘a’ found s3
s1 one ‘a’ found
s2 two ‘a’ found
s3 too many ‘a’ a, b

Equivalence of Regular Expressions and Finite-State Automata

1. For every regular expression “R”, defining a language “L”, there is a FSA “M”
recognizing exactly L.

2. For every FSA “M”, recognizing a language “L”, there is a regular expression
“R” matching all the strings of L and no others.
(we will prove this later)

Question: is there a FSA that can recognize { ë, ab, aabb, aaabbb, . . . } ??


Answer: No, because we need to “remember” how many a’s have been seen to
verify that there are as many b’s. Since an FSA can only have a finite
number of states there cannot be enough states to count the a’s.
We need a more powerful kind of recognizer... that is, a grammar.

1.0 Languages, Expressions, Automata 6

You might also like