Word acceptance and evaluation of algebraic runs
Lax369799.RunAcceptance · concepts/Lax369799/RunAcceptance.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For the algebraic unfold-automaton, legal runs expand into root-free reachable unary presentations with no blocked unary vertex. Projecting their branches back to the input preserves the run's word labels. The algebraic branch condition therefore makes a run accepting exactly when the evaluated run value is accepted (Lemmas 104–105).
Concept map
Evidence
This concept declares 6 statements. Each proof establishes one of them relative to its assumptions.
1 accepting_run_value proven
2 evaluated_run_accepting proven
3 evaluated_run_iff proven
4 exists_condition proven
5 labelling_accepting proven
6 shape proven
Lean source view on GitHub
Show ProofShow ProofShow ProofShow ProofShow ProofShow Proof
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments