Skip to content
Finite Automata and Regular Expressions episode artwork

Oct 5, 2026 13 min

Finite Automata and Regular Expressions

from Finite Automata and Regular Languages Hosted by Carlos Theran Suarez

Carlos and Maya explain DFAs, NFAs, closure properties, and regular expressions, ending with a short review quiz.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Finite Automata and Regular Expressions

0:00 13:45

No transcript yet.

Requests help us decide what to transcribe next.

Share this episode

Similar podcasts

French Your Way Jessica: Native French teacher founder of French Your Way Boost your French listening skills and test your comprehension with this one of a kind series of podcasts. Get the chance to listen to a real conversation between native speakers talking at normal speed AND customise your learning experience through carefully designed sets of questions (2 levels of difficulty) available for download at www.frenchvoicespodcast.com. All interviews also come with the transcript. French teacher Jessica interviews native speakers of French from around the world who share a bit of their life and passion. Where else would you meet in one same place a French yoga teacher based in Melbourne, a soap manufacturer from Provence, or a couple cycling around the world?

Frequently asked questions

How long is this episode of Finite Automata and Regular Languages?

This episode is 13 minutes long.

When was this Finite Automata and Regular Languages episode published?

This episode was published on October 5, 2026.

Can I download this Finite Automata and Regular Languages episode?

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