0

wanted to know whether binary division concept come from DFA i.e. from finite automata?

According to me the dfa would have lead to the binary division bcz we do binary divisons in computers only and we know that dfa have forms the base of computers operations so after having large sample size based on finite automata conclusion would have come that binary divsion would have come through xor operation which forms the base of the same.

skyconfusion
  • 123
  • 8
  • 1
    *nomen est omen* I guess – Random Dev Mar 05 '16 at 19:34
  • Huh? What do either of these have to do with the other? – Oliver Charlesworth Mar 05 '16 at 19:34
  • @oliver DFA could be used for Binary division. – skyconfusion Mar 05 '16 at 19:46
  • 1
    It is better to not answer than down vote the question, that's not encouraging. There r few ppl here looking for questions not to answer. Everyone can't be genius and be genius just not to answer. – skyconfusion Mar 05 '16 at 19:50
  • @skyconfusion DFA (or NFA) outputs in binary - "Yes" or "No" (accepted or rejected) only, so if you are looking the check weather a binary string is divisible by a number say 'n' or not that answer to your question is : yes --check this [Design DFA accepting binary strings divisible by a number 'n'](http://stackoverflow.com/questions/21897554/design-dfa-accepting-binary-strings-divisible-by-a-number-n/22282792#22282792) but if you wants to divide two numbers you need moor and mealy machines machine too check http://www.cse.chalmers.se/~coquand/AUTOMATA/book.pdf read Page 495 – Grijesh Chauhan Mar 07 '16 at 08:21
  • @Grijesh Thank you, I was looking for something like this. – skyconfusion Mar 07 '16 at 08:46
  • Possible duplicate of [Design DFA accepting binary strings divisible by a number 'n'](https://stackoverflow.com/questions/21897554/design-dfa-accepting-binary-strings-divisible-by-a-number-n) – Grijesh Chauhan Jan 16 '19 at 14:15

0 Answers0