Divisibility by 3 Tester - Logic, Formal Notation and Transition Table
Question - Design Finite Automata to accept decimal number divisible by 3.
These type of questions are solved by 4 steps.
1) Logic. 2) Formal Notation. 3) Transition Function. 4) Testing.
The transition function can either be represented using transition table or a transition diagram.
In this video, First three steps are covered.
Transition diagram will be explained in the next video.
And testing in the next to next video.
I hope you like the video. Rate, Comment and Subscribe if you would like to see more of these in your news feed. Thanks.
Find my Blog at - http://www.codefap.com
Follow me on Google+ - http://www.gplus.to/omkar4
Follow me on Facebook - / codefap
Follow me on Twitter - / codefap
My YT Channel 1 - / c0defap
My YT Channel 2 - / engineersminute
Watch video Divisibility by 3 Tester - Logic, Formal Notation and Transition Table online without registration, duration hours minute second in high quality. This video was added by user Engineers Minute 28 July 2013, don't forget to share it with your friends and acquaintances, it has been viewed on our site 18,14 once and liked it 15 people.