Theory of Computation - Class 8: Equivalence between Regular Expressions and Finite Automata

Why it's on BrighterTube

Editorial review · 85% confidence

Round-13 hunt: picked; source: named-course long-video search (round-12 queries, single-hit channels, second prefilter); channel screens (sellers/exam/re-upload/devotional/vendor/events), provenance check, vendor/seller/devotional recheck and quality tier C + tier-C depth check passed; strict per-title check + final strict pass; oEmbed verified.

What you'll learn

A 70-minute video from Jorge Perez: “Theory of Computation - Class 8: Equivalence between Regular Expressions and Finite Automata”.

Video by Jorge Perez, played through YouTube's embedded player.

Videos are embedded from YouTube and belong to their creators. BrighterTube isn't affiliated with YouTube or Google.

As an Amazon Associate, BrighterTube earns from qualifying purchases.

© 2026 BrighterTube