ConceptTheory & Algos
Decidability of ALBA
The acceptance problem for linear bounded automata is decidable because an LBA running long enough must repeat a configuration and loop, bounded by the finite number of possible configurations.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.