ConceptTheory & Algos
Bounded DFA ladder problem
A recursive procedure to determine if there is a ladder of a bounded length between two strings and in a DFA.
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
1Michael Sipser
Connections
5The lectures that define it or assume it, and the concepts next to it.