recategorized by
5,449 views

2 Answers

9 votes
9 votes

L1={a*baa*}={ba,aba,abaa,abaaa*,aa*baaa*,a*ba*a.....}

L2={ab*}={a,ab,abb*...}

L1/L2=a*ba*   {=b,ab,aba,abaa,a*baa....} so ans is C   

L1/L2={x: xy belongs to L1 for some y belongs to L2}

0 votes
0 votes

L1 ={ba,aba,abaa,baa,..................}

L2={ab*}

L1 / L2 operation not successful here

So, Ans D)

Answer:

Related questions

2 votes
2 votes
3 answers
1
go_editor asked Jul 14, 2016
7,691 views
Given a Non-deterministic Finite Automaton (NFA) with states $\text{p}$ and $\text{r}$ as initial and final states respectively and transition table as given below $:$$$\...
1 votes
1 votes
1 answer
2
go_editor asked Jul 14, 2016
2,179 views
The $mv$ command changesthe inodethe inode-numberthe directory entryboth the directory entry and the inode
3 votes
3 votes
1 answer
4
go_editor asked Jul 14, 2016
4,037 views
A virtual memory based memory management algorithm partially swaps out a process. This is an example ofshort term schedulinglong term schedulingmedium term schedulingmutu...