Example

The language EQUAL, of strings with number of a’s equal to number of b’s, defined over Σ={a,b}, can be written as

{Λ ,ab,aabb,abab,baba,abba,…}

Example

The language EVEN-EVEN, of strings with even number of a’s and even number of b’s, defined over Σ={a,b}, can be written as

{Λ, aa, bb, aaaa,aabb,abab, abba, baab, baba, bbaa, bbbb,…}

Example

The language INTEGER, of strings defined over Σ={-,0,1,2,3,4,5,6,7,8,9}, can be written as

INTEGER = {…,-2,-1,0,1,2,…}

Example

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

EVEN = { …,-4,-2,0,2,4,…}

Example

The language {aⁿbⁿ }, of strings defined over Σ={a,b}, as

{aⁿ  bⁿ  : n=1,2,3,…}, can be written as

{ab, aabb, aaabbb,aaaabbbb,…}

Example

The language {aⁿbⁿaⁿ }, of strings defined over Σ={a,b}, as

{aⁿ bⁿ aⁿ: n=1,2,3,…}, can be written as

{aba, aabbaa, aaabbbaaa,aaaabbbbaaaa,…}

Example

The language factorial, of strings defined over Σ={0,1,2,3,4,5,6,7,8,9} i.e.

{1,2,6,24,120,…}

Previous

TOC

Next