Multi-stack automata reachability: A New Tractable Subclass

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Multi-stack automata reachability analysis identifies tractable decidability subclass, teaching complexity theory and formal language theory. Research-level computation theory.

A 61-minute video from Microsoft Research: “Multi-stack automata reachability: A New Tractable Subclass”.

Video by Microsoft Research, played through YouTube's embedded player.