Register

Question on TOC

564 views
1 1 vote

Select the correct statements 

(1) L1 = L2 if and only if L1* = L2* 

(2) For any languages L1, L2 and L3, L1 (L2 ∩ L3) ⊆ (L1L2) ∩ (L1L3)

(3) For any languages L1, L2 and L3, (L1L2) ∩ (L1L3) ⊆ L1 (L2 ∩ L3).

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Peter Linz, 5th Edit...Next → · Consider a 256- CPU ...
← Previous in category · Peter Linz, 5th Edit...Next in category → · DFA construction
Position:
Show:

Related questions

1 1 vote
2 2 answers
647
647 views
aftab0711 asked Aug 11, 2024
647 views
Interesting question on Regular Language (TOC)
Which of the following languages is/are regular?
2 2 votes
2 2 answers
3.8k
3.8k views
admin asked Apr 3, 2019
3,776 views
Ullman (TOC) Edition 3 Exercise 3.1 Question 2 (Page No. 91)
Write regular expressions for the following languages$:$The set of all strings of $0's$ and $1's$ such that every pair of adjacent $0's$ appears before any pair of adjace...
0 0 votes
0 0 answers
1.1k
1.1k views
admin asked Apr 3, 2019
1,123 views
Ullman (TOC) Edition 3 Exercise 3.1 Question 1 (Page No. 91)
Write regular expressions for the following languages$:$The set of strings over alphabet $\{a,b,c\}$ containing at least one $a$ and at-least one $b.$The set of strings o...
1 1 vote
2 answers 2 answers
2.8k
2.8k views
Ashish Roy 1 asked Sep 27, 2018
2,793 views
TOC (Regular expression)
Given two Regular expressions are equal or not ?1) (1+01*0)* 2) 1*(01*0)* 1*Give proper explanation also.