314 views

1 Answer

0 votes
0 votes
  • any language is concatenation with $\Phi$ is equal to $\Phi$

1)a.$\Phi$ =$\Phi$

2)a*.$\Phi$ =$\Phi$

  • any language(x) is concatenation with $\lambda$ is is equal to X. (except  $\lambda$.$\Phi$= .$\Phi$)

1)a. $\lambda$ =a

2)a*. $\lambda$=a*

Related questions

1 votes
1 votes
1 answer
1
Abbas Ahmad asked Nov 30, 2018
411 views
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regularb) G may or may not be regularc) something else
0 votes
0 votes
0 answers
2
iarnav asked Jan 30, 2018
202 views
L = anbm / n,m>=1What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same valu...
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4