Timeline for How does modulus affect the regularity of language?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2018 at 2:45 | comment | added | rballiwal | i find your answer incorrect if you are saying that for N(a)-N(b) = 2k, 3k... we can not form an automata. beacuse we can | |
| Sep 29, 2018 at 16:07 | comment | added | rballiwal | one more thing that we cannot form finite automata for n(a) - n(b) = 2k, 3k,4k...and so on | |
| Sep 29, 2018 at 15:36 | comment | added | David Richerby | Oh, sorry, I missed the modulus. I don't have time to look at this now but I'll try to see later if it makes any difference. | |
| Sep 29, 2018 at 15:13 | comment | added | rballiwal | ok i have no problem with modulo but , by your reasoning i assume that we can formulate an automata of n(a) -n(b) = 2k, 3k,.. even for the conditions like |n(a)- n(b)| = even, odd, 3k,2k,. (remember i have used modulus function that is different from modulo function) with modulus the reason being that the difference between a and b being divisible by 2 without any order in occurrence of a and b. but when we say , n(a)- n(b) =2k we say that the order of occurence of a and b matters . is that right? , also we can say that (n(a)-n(b)) mod 2 =0, have same language as (n(a) -n(b) ) mod 2 =0 ? | |
| Sep 29, 2018 at 13:23 | history | answered | David Richerby | CC BY-SA 4.0 |