0 0 votes The numbers 1,2,4,8,…2n,…1,2,4,8,…2n,… written in unary Is regular or not?? if not please justify?? Theory of Computation theory-of-computation finite-automata gateoverflow + – learner_geek 976 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 2 2 votes It is not a regular language. The reason is there is NO DFA that could accept this language. If the language is infinite, there must be a pattern in it for being a regular language.The pattern means that..length of strings should be in AP that could be checked through loops. In this language, no loop is possible. I hope this helps. Vivek Jain answered Aug 13, 2017 • selected Aug 13, 2017 by learner_geek Vivek Jain comment Share Follow See all 2 Comments 2 2 Comments reply learner_geek commented Aug 13, 2017 reply Follow flag @vivek jain Actually i was thinking for below dfa but i got your point below dfa accept all strings given in language {1,11,1111,11111111,.......}no problem@ but it also accepts unwanted strings{111,11111....} so not accepted right! 0 0 replyShare Vivek Jain commented Aug 13, 2017 reply Follow flag yeah..the DFA must also reject the strings not in the language. 1 1 replyShare Please log in or register to add a comment.
0 0 votes It is not regular language becoz given format or string not in AP . 1gate_cracker answered Nov 10, 2017 1gate_cracker comment Share Follow 0 reply Please log in or register to add a comment.
