Rankwise-finite recognition implies automaton recognition
Lax369799.AlgebraToAutomaton · concepts/Lax369799/AlgebraToAutomaton.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
An unfold-invariant language of systems recognised by a rankwise-finite algebra is recognised by an unfold-automaton. This is in Section 6.3. The recognising algebra in the hypothesis is not assumed to be unfold-invariant; unfold-invariance is a property of the language.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.SupportedAlgebras |
| 2 | import Lax369799.UnfoldAutomata |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Rankwise-finite recognition implies automaton recognition |
| 7 | type: theorem |
| 8 | --- |
| 9 | An unfold-invariant language of systems recognised by a rankwise-finite |
| 10 | algebra is recognised by an unfold-automaton. This is `thm:alg2aut` in |
| 11 | Section 6.3. The recognising algebra in the hypothesis is not assumed to |
| 12 | be unfold-invariant; unfold-invariance is a property of the language. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.AlgebraToAutomaton |
| 16 | open RankedSystems Algebras UnfoldAutomata |
| 17 | |
| 18 | axiom algebra_to_automaton {A : RankedSet} (L : Language A) |
| 19 | (hL : UnfoldInvariantLanguage L) (hA : SupportedAlgebras.Recognizable L) : |
| 20 | ∃ M : UnfoldAutomaton A, UnfoldAutomata.Recognizes M L |
| 21 | |
| 22 | end Lax369799.AlgebraToAutomaton |
| 23 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments