Register

toc#reguler

• retagged by
178 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
satyam132 asked Mar 30, 2018
213 views
toc#reguler
Let $L1$ be a regular language and $L2=L1^*$. then $L2$ is?? a)always finite language b)always infinite language and regular c)need not be infinite language. d)none
Let $L1$ be a regular language and $L2=L1^*$. then $L2$ is??a)always finite languageb)always infinite language and regularc)need not be infinite language.d)none
User Avatar
1 votes
1 votes
1 answer
2
satyam132 asked Mar 29, 2018
187 views
toc#reguler
L1=0*1*, L2=1*0*, L3=(0+1)*, L4=0*1*0*. then find the number of string in the following language L L=(L1$\cap$ L2) - (L3$\cap$L4)
L1=0*1*, L2=1*0*, L3=(0+1)*, L4=0*1*0*. then find the number of string in the following language LL=(L1$\cap$ L2) - (L3$\cap$L4)
User Avatar
Link Copied!