Scribd
Upload
19 views8 pages

Assignment 1

Uploaded by

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

Assignment 1

Uploaded by

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

Assignment # 1

(Automata Theory)
 Example 1:
The language L of strings of odd length,
defined over Σ={a}, can be written as
 Example 2:
The language L of strings that does not
start with b, defined over Σ={a,b,c}, can
be written as
 Example 3:
The language L of strings of length 2,
defined over Σ={0,1,2,3}, can be written
as
 Example 4:
The language L of strings ending in 0,
defined over Σ ={0,1}, can be written
as
 Example 5:
The language EQUAL, of strings with
number of a’s equal to number of b’s,
defined over Σ={a,b}, can be written as

 Example 6:
The language EVEN-EVEN, of strings
with even number of a’s and even
number of b’s, defined over Σ={a,b},
 Example 7:
The language INTEGER, of strings defined
over
Σ={-,0,1,2,3,4,5,6,7,8,9}, can be written
as

 Example 8:
The language EVEN, of stings defined over
Σ={-,0,1,2,3,4,5,6,7,8,9}, can be written
as
 Example 9:

The language {anbn}, of strings defined


n n
 Example 10:
The language {anbn an}, of strings defined
over Σ={a,b}, as {anbn an : n=1,2,3,…},
can be written as
 Example 11:
The language factorial, of strings defined
over Σ={1,2,3,4,5,6,7,8,9}
 Example 12:
The language FACTORIAL, of strings
defined over Σ={a}, as {an! : n=1,2,3,…},
can be written as
It is to e noted that the language
FACTORIAL can be defined over any single
letter alphabet.
 Example 13:
The language DOUBLEFACTORIAL, of
strings defined over Σ={a, b}, as {an! bn! :
n=1,2,3,…}, can be written as

 Example 14:
The language SQUARE, of strings defined
over
Σ={a}, as
{an2 : n=1,2,3,…}, can be written as
 Example 15:
The language DOUBLESQUARE, of
strings defined over Σ={a,b}, as
{an2 bn2 : n=1,2,3,…}, can be written
 as
Example 16:
The language PRIME, of strings defined
over
Σ={a}, as
{ap : p is prime}, can be written as
An Important language
 PALINDROME
The language consisting of Λ and the
strings s defined over Σ such
that Rev(s)=s. It is to be denoted that the
words of PALINDROME are called
palindromes.

 Example:
For Σ={a,b},

You might also like