Uploaded May 2023 | Updated September 2026, 3 weeks ago
Non deterministic finite state automata described and then shown in Python by Professor Thorsten Altenkirch
Here is the code used in the video cs.nott.ac.uk/~psztxa/computerphile/nfa.py.
And here is my solution to the powerautomaton construction.
http:/wwW.cs.nott.ac.uk/~psztxa/computerphile/nf a-sol.py
#nfa #code #python #Thorsten #automata
facebook.com/computerphile
twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at bradyharan.com
Non deterministic finite state automata described and then shown in Python by Professor Thorsten Altenkirch
Here is the code used in the video cs.nott.ac.uk/~psztxa/computerphile/nfa.py.
And here is my solution to the powerautomaton construction.
http:/wwW.cs.nott.ac.uk/~psztxa/computerphile/nf a-sol.py
#nfa #code #python #Thorsten #automata
facebook.com/computerphile
twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at bradyharan.com










