The Gateway to Computer Science Excellence
0 votes
30 views

 Describe the languages denoted by the following regular expressions:

  1. $a(a\mid b)^{\ast}a.$
  2. $((\epsilon\mid a)b^{\ast})^{\ast}.$
  3. $(a\mid b)^{\ast}a(a\mid b)(a\mid b).$
  4. $a^{\ast}ba^{\ast}ba^{\ast}ba^{\ast}.$
  5. $(aa\mid bb)^{\ast}((ab\mid ba)(aa\mid bb)^{\ast}(ab\mid ba)(aa\mid bb)^{\ast})^{\ast}.$
in Compiler Design by Veteran (54.9k points) | 30 views

1 Answer

0 votes
a). start and end with a.

b). (a+b)* or we can say universal set on symbols (a,b).

c). end with aaa or aab or aba or abb.

d). containing exactly 3 b's.

e). m solving (i will post (e) asap.)

correct me if wrong..
by (263 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,507 answers
195,558 comments
101,060 users