Register

Is phi a regular language or not

• edited by
1,752 views

1 Answer

2 votes
2 votes
Phi is regular. As we all know Summation(*) is regular language and its complement is emty set(phi). Since Complementation of regular languges is closed. Thus phi is also regular.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
sachin_27 asked Jun 1, 2022
1,310 views
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
User Avatar
0 votes
0 votes
2 answers
2
rohan.1737 asked Aug 17, 2018
706 views
Self Doubt in checking whether a language is regular or not
Is there any way to check whether a language is regular or not without using Pumping lemma?
Is there any way to check whether a language is regular or not without using Pumping lemma?
User Avatar
0 votes
0 votes
1 answer
4
sumit kumar asked Jun 22, 2015
7,980 views
how to find whether a language is regular or not
my question is whether we have a shortcut an idea which can help us in recognizing any language to be regular or not,in GATE .and also what is the best way to get it properly done when you want to do it the old school way?
my question is whether we have a shortcut an idea which can help us in recognizing any language to be regular or not,in GATE .and also what is the best way to get it prop...
User Avatar
Link Copied!