Register

regular language

260 views
1 votes
1 votes
regular language infinite intersction not neccessary regular?????????? any body have example
User Avatar

Please log in or register to answer this question.

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

Related questions

219
views
2 answers
0 votes
programmer1218 asked Apr 11
219 views
Regular language
Can anyone explain how we can write this regular language for the following diagram ?(in depth)
User Avatar
259
views
1 answers
0 votes
Deepak9000 asked Nov 27, 2023
259 views
Not Regular language [find out]
Why is C is regular as it non regular as?Please help me with this confusion
User Avatar
840
views
1 answers
0 votes
M_Umair_Khan42900 asked Dec 29, 2022
840 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)*(c) (s*ttt)*s* and s*(ttts*)*
User Avatar
253
views
0 answers
0 votes
M_Umair_Khan42900 asked Dec 29, 2022
253 views
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular.a) ( ... 9) with characters in sorted orders.c) The set of all even binary numbers
User Avatar
Link Copied!