Proof of `NL is acceptance by two-way multihead automata` (1st statement)
groundedproofs/Lax485149Proofs/Bridge.lean · lax-485149
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The library's theorem: an automaton is a specification, and a specification is compiled into an automaton.