Thread replies: 6
Thread images: 2
Thread images: 2
Anonymous
Automata theory - An ez way to see if a Language is regular? 2017-04-08 11:54:09 Post No. 59793812
[Report] Image search: [Google]
Automata theory - An ez way to see if a Language is regular? 2017-04-08 11:54:09 Post No. 59793812
[Report] Image search: [Google]
File: arturia10.jpg (235KB, 525x849px) Image search:
[Google]
235KB, 525x849px
Automata theory - An ez way to see if a Language is regular?
Anonymous
2017-04-08 11:54:09
Post No. 59793812
[Report]
Given some language L, what would be an ez life hack way of finding if its regular or not without using the pumping lemma.
This is mainly in the context of a mid term exam, my prof said theres going to be some yes/no circle questions to answer whether a language is regular or not.
For instance, its not at all obvious to anyone hearing for the first time that L = {w | w contains same # of occurences of 01's and 10's}, but it is indeed regular unlike the old L = {a^n b^n | n >= 0 } non regular example
halp pls
>>
>>59793812
Nope, gotta use the pumping lemma.
>>
>>59793825
wtf i hate my prof now
seriously though, why would he do this, its so easy to either get stuck or not "think of a good string" or make a general mistake trying to pump 10 questions or something...
>>
>>59793876
well, don't panic. every automata theory course worth its salt will go over it. just look up a bunch of examples.
>>
>>59793921
>well don't panic
test is literally 30% of final grade, dont know how many questions there will be but I guess not many so every mark is potentially 1% of my final grade acquired or gone ;-;
>>
>>59793812
pumping lema is the general way to verify if a language is regular
there are other easier ways to check for some languages, for example all finite languages are regular, or trying to write a regular expression for it
Thread posts: 6
Thread images: 2
Thread images: 2