Register

#Theory of computation #Regular Expresions

382 views

3 Answers

1 votes
1 votes
Yes RE always generates a language, infact it is one of the way of describing regular languages apart from Finite state machines and regular grammars. Some of the languages generated by primitive RE are PHI, NULL STRING i.e. {€} & {a}. Other languages are derived from these primitive REs by a finite number of applications of R1+R2 (Union), r1.r2 (concatenation) , R1*(closure) & (R1).
User Avatar
0 votes
0 votes

yes definite....

i think...

every RE is capable for generating at least one string including Epsilon...

and we know that every language is { the set of strings obtaining from finding power set of set of all strings(SIGMA*)}...or 

we can say every language is the power set of SIGMA*.....

User Avatar
0 votes
0 votes
yes its must be true

bcz every finite language is an REGULAR LANGUAGE

 and more over every REGULAR LANGUAGE  is an FINITE LANGUAGE and that has to be accepted by pumping lemma
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
Pavan Kumar Munnam asked Nov 6, 2016
1,457 views
#toc #regular languages
Why this is not a regular language pls explain?
Why this is not a regular language pls explain?
User Avatar
3 votes
3 votes
5 answers
3
Desert_Warrior asked Apr 13, 2016
2,533 views
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these
User Avatar
0 votes
0 votes
1 answer
4
Crackca asked Sep 13, 2021
343 views
#theory-of-computation
If L1 = {a^nb^nc^md^m | n,m>=0} L2 = {a^nb^n | n>=0} L3 = {c^md^m | m>=0} Then L1 – L2.L3(concatenation) is? Regular CSL CFL REL(recursive enumerable)
If L1 = {a^nb^nc^md^m | n,m>=0}L2 = {a^nb^n | n>=0}L3 = {c^md^m | m>=0}Then L1 – L2.L3(concatenation) is?RegularCSLCFLREL(recursive enumerable)
User Avatar
Link Copied!