Timeline for How does modulus affect the regularity of language?
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 6, 2018 at 12:16 | comment | added | rballiwal | @Apass.Jack there? | |
| Oct 6, 2018 at 7:20 | comment | added | rballiwal | @Apass.Jack the answer by aknautiyal is wrong just make the automata for |N(a)-N(b)| = 3n and its wrong | |
| Oct 2, 2018 at 2:43 | comment | added | rballiwal | @Apass.Jack his answer is ok for |n(a) -n(b) | = 2k , but when asked about N(a)-N(b) = 2k he said that we can not form a general automata , so that is in fact weird , as we can form one with 3 states representing {-1,0,1} .please beware that -1 is is nothing but a state where the string like , b,bbb goes but this only means that they should not be accepted i.e after reaching bbb the FA should reach a state that is not final . but saying existence of bbb does not satisfy the nature of equation is absurd. so yeah we can form an automata for n(a) -N(b) = 2k, 3k, 4k,... | |
| Oct 2, 2018 at 0:03 | comment | added | John L. | @aknautiyal's answer is pretty good In fact. I advise you to up-vote and accept it. Unless you have any further doubt, which should be another question probably, I will not write another answer that will be basically a duplicate. | |
| Oct 1, 2018 at 6:58 | comment | added | rballiwal | i will upvote it if found good | |
| Oct 1, 2018 at 6:15 | comment | added | rballiwal | @Apass.Jack i request you to read question once again and i think you will find that i have asked more than two thing of which some being like , whether is the difference ( N(a) -N(b) )is even(or divisible by 2) ,but i have asked the same in more general form like is the difference( N(b) -N(b) ) is divisible by 3 to which i have written an equation of form N(a) -N(b) = 3k , where 3k being set of natural numbers. i thought that you will understand but my bad you did not . so can you answer now that whether for ( N(a)-N(b) ) =3k (where k is set of natural number ) we can form a finite automata | |
| Sep 30, 2018 at 15:08 | comment | added | John L. | Sorry, which one do you mean? I asked a question of two choices. But you answered with yes. Once again, do you mean $L_k$ for a fixed $k$ or do you mean the difference is even? Or do you think those two choices are the same (to me, those two choices are very different)? | |
| Sep 30, 2018 at 11:38 | history | edited | rballiwal | CC BY-SA 4.0 |
i have encountered that many of you are mistakenly reading k as an integer which its not and that is what i have edited
|
| Sep 30, 2018 at 11:35 | comment | added | rballiwal | @Apass.Jack yeah the language described is just a single case of a generalisation but it answers only one aspect my whole problem which have a many small yet important aspect connected to the language L but here the have just made an automata of language and that it @ david had said for generalisation but iam awaitng his further response | |
| Sep 30, 2018 at 7:29 | comment | added | John L. | "$L = \big\{ w : w \in \{a,b\}^*,\ |n(a) - n(b)| = 2k\}$", you said. Do you mean $L_k = \big\{ w : w \in \{a,b\}^*,\ |n(a) - n(b)| = 2k\}$ for some fixed non-negative integer $k$, or $L = \big\{ w : w \in \{a,b\}^*,\ |n(a) - n(b)| \text { is even}\}$? Apparently, people are answering your question according to either one of these interpretations. | |
| Sep 29, 2018 at 18:30 | answer | added | aknautiyal | timeline score: 2 | |
| Sep 29, 2018 at 16:54 | history | edited | rballiwal | CC BY-SA 4.0 |
edited title
|
| Sep 29, 2018 at 13:23 | answer | added | David Richerby | timeline score: 3 | |
| Sep 29, 2018 at 13:09 | history | edited | David Richerby | CC BY-SA 4.0 |
Copy-edit
|
| Sep 29, 2018 at 12:38 | history | edited | rballiwal | CC BY-SA 4.0 |
deleted 89 characters in body
|
| Sep 29, 2018 at 3:49 | history | asked | rballiwal | CC BY-SA 4.0 |