What is Deterministic Automata? Post author:Educate Post published:September 4, 2023 Post category:FLAT Post comments:0 Comments A finite automaton is deterministic ifa. It has no transition of input E .b. For each state s and input symbol a, there is at most one edge labeled a leaving s. You Might Also Like Define ambiguity September 4, 2023 Prove that L={ all strings of 1’s whose length is prime} is not regular. i.e., L={1^2,1^3 ,1^5 ,1^7 ,1^11 ,—-} December 9, 2023 Regular Expressions November 7, 2023 Leave a Reply Cancel replyCommentEnter your name or username to comment Enter your email address to comment Enter your website URL (optional) Save my name, email, and website in this browser for the next time I comment.
Prove that L={ all strings of 1’s whose length is prime} is not regular. i.e., L={1^2,1^3 ,1^5 ,1^7 ,1^11 ,—-} December 9, 2023