We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 1325bf1 commit 0ac76b8Copy full SHA for 0ac76b8
1 file changed
README.md
@@ -16,7 +16,7 @@ This repository contains a formalization of Mazurkiewicz trace theory in the Lea
16
### Ochmański's Theorem
17
- `Language.lean` contains basic definitions and lemmas for trace languages.
18
- `MyhillNerode.lean` supplies a proof of the Myhill-Nerode theorem in the context of monoids.
19
-- `Hashiguchi.lean` currently contains just the statement of Hashiguchi's theorem on sufficient conditions for a trace language to have finite rank.
+- `Hashiguchi.lean` contains a proof of Hashiguchi's theorem on recognizable trace closures.
20
- `RegularExpressions.lean` reinterprets mathlib4's `RegularExpression` on traces.
21
- `Ochmanski.lean` contains the proof of Ochmański's theorem on recognizable trace languages and lemmas leading up to it.
22
0 commit comments