Jon Sterling on Nostr: To give an example, we proved rule induction like three lectures ago. But for some ...
To give an example, we proved rule induction like three lectures ago. But for some reason, the proof of rule induction (a subtle induction on the maximum height of derivations) is *inlined* into the proof that every regular language can be computed by a finite automaton??
Published at
2025-02-14 18:23:44Event JSON
{
"id": "545783b35712805500548e2968f6076d4a87a8571bf99c800080e3f183797750",
"pubkey": "ba51d3bb7fc92891016b5873c0b4f7c6a0550c964ec565ece24b6fc2dcf93301",
"created_at": 1739557424,
"kind": 1,
"tags": [
[
"e",
"79c27cc73136856072fd3d175da96b3bdaba214e601485cedfaefce3619fa501",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://mathstodon.xyz/users/jonmsterling/statuses/114003635375250821",
"activitypub"
]
],
"content": "To give an example, we proved rule induction like three lectures ago. But for some reason, the proof of rule induction (a subtle induction on the maximum height of derivations) is *inlined* into the proof that every regular language can be computed by a finite automaton??",
"sig": "704a1eab32d8d4ca03a15457ff9be6f903bfb4dc6821ea342e05c4820e8ddd3d636b17bf9acaac357d43f550a7a6e78cbc784814acc117531ef18dd65a11bea3"
}
