Scribd
Upload
33 views4 pages

Thoery of Automata4!5!2019

The document defines theory of automata concepts such as language unions and products. It provides examples of unions and products of languages. It also discusses regular expressions to represent languages including ones with constraints such as not ending with double letters or containing certain substrings. Recursive definitions and polynomials are also covered with examples given to demonstrate the concepts.

Uploaded by

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

Thoery of Automata4!5!2019

The document defines theory of automata concepts such as language unions and products. It provides examples of unions and products of languages. It also discusses regular expressions to represent languages including ones with constraints such as not ending with double letters or containing certain substrings. Recursive definitions and polynomials are also covered with examples given to demonstrate the concepts.

Uploaded by

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

Theory of automata(TOA) 5/4/2019

Definitions:If S is an language and T is another language.


Union:S+T
Product:S*T

Examples:

S=a, bb
T=a,ab

S+T={a,bb,a,ab}
ST={aa,aab,bba,bbab}

Example 2:

S={a,bb,bab}
T={a,ab}

S*T={aa,aab,bba,bbab,baba,babab}

P={a,bb,bab}
Q={empty,bbbb}

P*Q={abbbb,bbbbbb,babbbbb}
Begin with b and end with a

B(a+b)*A or
b(ab)*a

(a+b)*=a,ab,aabb….
(ab)*=ab,abab,ababab….
Do not end with double letters….

(a+b)*+a+b

Atleast one a and one b


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

B letter is never tripple..


(empty+b+bb)(a+ab+abb)

Recursive:

L1 ={x,xx,xxx,….} or {x,x2,x3……} or x+
Rule1: x is a basic object
Rule2: x(n+1) where n=0,1,2,3,4….
Rule2:Allow only according to rule 2…

Polynomial:Definition

X8+X4

1. Rule2:x is an polynomial..
2. Rule2:x is a polynomial
3. Rule3:x2 is a polynomial.. (1,2)
4. Rule3:x3 is a polynomial.. (3,2)
5. Rule3:x5 is a polynomial.. (4,3)
6. Rule3: x8 is a polynomial (5,4)
7. Rule3:x4 is a polynomial (4,2)
8. Rule3:x8 +x4 is a polynomial (7,6)

Hence we prove ::X8+X4

All words that do not have the substring ab

Regular expresion:: b*a*


Strings:: a,b bba,bbaa,bbbaaa,bbbbaaaaa

You might also like