0 votes 0 votes Is the following language regular or not? Theory of Computation theory-of-computation regular-language made-easy-test-series + – Anu Sreenivasan Unni asked Jan 25, 2019 • edited Mar 3, 2019 by ajaysoni1924 Anu Sreenivasan Unni 663 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Satbir commented Jan 25, 2019 reply Follow Share yes. (modular counting is regular ) 1 votes 1 votes Anu Sreenivasan Unni commented Jan 25, 2019 reply Follow Share Can u please elaborate how is it possible to construct a dfa/nfa for this problem. :) 0 votes 0 votes Satbir commented Jan 25, 2019 reply Follow Share state/inputs x y z A(final state) B B B B C C C C D D D D E E E E A A A 0 votes 0 votes s_dr_13 commented May 11, 2019 reply Follow Share What are the other options bro ?? It is general fact that modular counting is always regular 0 votes 0 votes Satbir commented May 11, 2019 reply Follow Share Other options is to make a DFA or NFA for it or use pumping lemma to show that its not regular. A language is said to be regular if you can draw a Finite Automata for it. Every mod n counting has n states and the remainder that we want is the final state. for example mod 3 counting will have 3 states and if we want remainder as 1 then the middle state will be the final state. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes state/inputs x y z A B B B B C C C C D D D D E E E E A A A A is the initial as well as final state. since we can draw a finite automata for this language => the language is regular. Satbir answered Jan 25, 2019 Satbir comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu Sreenivasan Unni commented Jan 26, 2019 reply Follow Share Thanks for the solution. I still have a doubt that while providing the loop back to state A from state E there will be strings out of the language and they also get accepted right?. Also x should be followed by y and then by z. Please clear this one. Appreciate that :) 0 votes 0 votes Satbir commented Jan 26, 2019 reply Follow Share yes.... you are correct. xzy will also be accepted. Here i only checked l+m+n mod 5 and forgot to check the order. :( 0 votes 0 votes Anu Sreenivasan Unni commented Jan 26, 2019 reply Follow Share Yeah. The one's who came up with this question are saying it as a regular language. Still now am confused of their statement . Is there a way to realize this?. " Whenever we provide a feedback transition from a state then the language acts like kleen closure. " 0 votes 0 votes Please log in or register to add a comment.