Skip to content
Non-Deterministic Automata - Computerphile episode artwork

EPISODE · Oct 20, 2026 · 27 MIN

Non-Deterministic Automata - Computerphile

from Computerphile · host Computerphile

Non deterministic finite state automata described and then shown in Python by Professor Thorsten Altenkirch Here is the code used in the video http://www.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 https://www.facebook.com/computerphilehttps://twitter.com/computer_phileThis video was filmed and edited by Sean Riley.Computer Science at the University of Nottingham: https://bit.ly/nottscomputerComputerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com Learn more about your ad choices. Visit megaphone.fm/adchoices

Episode metadata supplied by the publisher feed · Published Oct 20, 2026

Embed this episode

Ready to play

Non-Deterministic Automata - Computerphile

0:00 27:53

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Computerphile?

This episode is 27 minutes long.

When was this Computerphile episode published?

This episode was published on October 20, 2026.

Can I download this Computerphile episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!