PadhaikoAll subjects

Past exam question: 2081 Chaitra (Regular), Q1(c)

Theory of Computation · 2 marks

Open in the Padhaiko app

Topic: Alphabets, Languages & Operations on Languages

Question

What are power of an alphabet and positive closure of an alphabet?

Solution

Definitions of Alphabet Power and Positive Closure: Let be a non-empty finite set of symbols called an alphabet:

  1. Power of an Alphabet (): The -th power of an alphabet, denoted by , is the set of all strings of length exactly formed by symbols from :
  1. Positive Closure of an Alphabet (): The positive closure of an alphabet , denoted by , is the set of all possible non-empty strings of finite length formed from :

Relation to Kleene Star :

Answer:

The power of an alphabet is the set of all strings of length over (, with ). The positive closure is the union of all powers (all non-empty finite strings: ).

All past exam questions for Theory of Computation