WebliminalBlog : NFAs – non deterministic finite state automata

Skip to content

{ 2011 09 24 }

NFAs – non deterministic finite state automata

I am teaching Theoretical Foundations of Computer Science again, and so the exploration and explanation of nod-deterministic finite state automata is on my mind. Here are a few related links

http://www.eecs.wsu.edu/~cook/tcs/l7.html

nfa lecture with proof that NFA <–> DFA

(tags: nfa cpsc326)
CMSC 451 Lecture 5, NFA with epsilon moves

One of a series of lectures

(tags: nfa cpsc326)
Nondeterministic finite-state machine – Wikipedia, the free encyclopediaÂ Wikipedia entry for NFA
(tags: nfa cpsc326)

Index of /~baldwin/csci342

Doug Baldwins lectures for a course similar to cpsc326

(tags:Â cpsc326)
http://web.cecs.pdx.edu/~harry/compilers/slides/LexicalPart3.pdf

A little long, but goes through all the steps of converting NFA to DFA with epsilon transitions

(tags:Â algorithmÂ convertÂ nfaÂ dfaÂ cpsc326)
http://www.cs.odu.edu/~toida/nerzic/390teched/regular/fa/nfa-2-dfa.html

convert nfa to dfa

(tags:Â nfaÂ dfaÂ computerscience)

Posted by ernie on Saturday, September 24, 2011, at 6:03 am. Filed under Teaching. Tagged cpsc326, nfa. Follow any responses to this post with its comments RSS feed. You can post a comment or trackback from your blog.

Post a Comment