Search for tag: "dfa"

ECS 120 5a:5 corollary of Myhill-Nerode Theorem we use and its proof

+19 More
From  David Doty 0 likes 258 plays 0  

ECS 120 5a:4 statement of Myhill-Nerode Theorem

+19 More
From  David Doty 0 likes 352 plays 0  

ECS 120 6a:1 languages decided-recognized by TMs

+19 More
From  David Doty 1 likes 437 plays 0  

ECS 120 5c:4 formal definition of TM semantics

errata: At 4:38, I incorrectly said and wrote that L,R,S correspond to +1, -1, and 0. They correspond to -1, +1, and 0, i.e., moving left (L) decrements (-1) the tape head position, and moving right…

+19 More
From  David Doty 1 likes 364 plays 0  

ECS 120 5b:2 pumping lemma proof that 0n1n is not regular

+19 More
From  David Doty 1 likes 346 plays 0  

ECS 120 5b:1 pumping lemma for regular languages

+19 More
From  David Doty 1 likes 119 plays 0  

ECS 120 5a:4 direct proof that uu is not regular

+19 More
From  David Doty 1 likes 68 plays 0  

ECS 120 5a:3 picture of previous proof

+17 More
From  David Doty 1 likes 63 plays 0  

ECS 120 5a:2 direct proof that equal zero-one is not regular

+19 More
From  David Doty 1 likes 89 plays 0  

ECS 120 5a:1 why we need rigor to argue that a language is not regular

+19 More
From  David Doty 1 likes 305 plays 0  

ECS 120 4b:3 NFAs can simulate RRGs proof

+19 More
From  David Doty 1 likes 264 plays 0  

ECS 120 4b:4 right-regular versus left-regular grammars

+19 More
From  David Doty 1 likes 231 plays 0  

ECS 120 4b:2 RRGs can simulate DFAs proof

+19 More
From  David Doty 1 likes 257 plays 0  

ECS 120 4b:1 RRGs can simulate DFAs example

+19 More
From  David Doty 1 likes 415 plays 0  

ECS 120 4a:5 alternative choices in subset construction

+19 More
From  David Doty 1 likes 255 plays 0  

ECS 120 4a:3 proof DFAs can simulate NFAs with no epsilon-transitions

+19 More
From  David Doty 1 likes 318 plays 0