nielstron/langlib
A Lean 4 formalization of grammar and automaton presentations of the extended Chomsky hierarchy. Starting from unrestricted-grammar rewriting, it defines regular, linear, context-free, context-sensitive, indexed, deterministic context-free, recursive, and recursively enumerable language classes; relates finite, pushdown, linearly bounded, and Mathlib TM0 automata to the corresponding grammar classes; proves strict hierarchy inclusions; and establishes closure or non-closure under thirteen operations for seven major classes.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-08-27-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-27-000011/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-27-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'