Lax52.MSOAutomataEquivalence
Büchi-Elgot-Trakhtenbrot theorem for finite words
concepts/Lax52/MSOAutomataEquivalence.lean · lax-52
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Theorem
Over a finite alphabet, a language of finite words is recognizable by a nondeterministic finite automaton if and only if it is definable by a monadic second-order sentence in the ordered word structure with one unary predicate for each letter.
Lean source view on GitHub
| 1 | import Lax52.NFAToMSO |
| 2 | import Lax52.MSOToNFA |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Büchi-Elgot-Trakhtenbrot theorem for finite words |
| 7 | type: theorem |
| 8 | --- |
| 9 | |
| 10 | Over a finite alphabet, a language of finite words is recognizable by a |
| 11 | nondeterministic finite automaton if and only if it is definable by a monadic |
| 12 | second-order sentence in the ordered word structure with one unary predicate |
| 13 | for each letter. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax52.MSOAutomataEquivalence |
| 17 | |
| 18 | open Lax52.MSOSyntax |
| 19 | open Lax52.WordStructure |
| 20 | open Lax52.NFARecognizable |
| 21 | |
| 22 | universe u |
| 23 | |
| 24 | axiom nfaRecognizable_iff_msoDefinable {Sigma : Type u} [Fintype Sigma] |
| 25 | (L : _root_.Language Sigma) : |
| 26 | NFARecognizable L ↔ |
| 27 | ∃ phi : MSOSyntax.Sentence (wordLanguage Sigma), L = sentenceLanguage phi |
| 28 | |
| 29 | end Lax52.MSOAutomataEquivalence |
| 30 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments