Showing posts with label theory of computation. Show all posts
Showing posts with label theory of computation. Show all posts

Thursday, March 14, 2013

Deterministic Finite Automata



  • Deterministic Finite Automata

Given a state and a symbol, the next state is “determined”.

https://docs.google.com/viewer?a=v&q=cache:CnIhJXltnSAJ:https://courses.engr.illinois.edu/cs373/Lectures/lec02.pdf+&hl=en&pid=bl&srcid=ADGEESjbVJuZkjvw9Vd7-Y04m6eLDfdt4-VC42o7uvlP5oGFE27s4amdz8Y6r-9WYq_qKxPKb5Gxl9WaJfb_ROTM0Dm6FB-Y9NUJui9m1-RqfrGXepW3uSweDtZsOPMgMcb2IANtChfg&sig=AHIEtbSRmjiyMVyP4Z5BzzLEMIJqWvyluQ

State-transition diagrams


State-transition diagrams
In a state diagram the starting state is denoted by a circle with an “incoming arrow” and an accepting state is denoted by a double circle.

https://docs.google.com/viewer?a=v&q=cache:pNTot0ra-aEJ:research.cs.queensu.ca/home/cisc223/2013w/moni/m2.pdf+&hl=en&pid=bl&srcid=ADGEEShE2PTVOg4vQrI6-WKlf50OAXw9Ou0UOkpS1N8fYFoQ_ZkrFwZvgLTUtxEHw100kM0_wDaTh3INeyKzmdmnimFdm-riP6xMwpSvhy0-nPWf2Pq-MKnRLTIN9sK4u7kKwhjkxWW6&sig=AHIEtbSfQzHH1GN-LDYM6wqKV5mFdBSo8Q