VRETA
About:Mathematical study of sets of strings defined by precise grammatical rules.
Problem

Nobody told me I needed comfort with induction on derivation length

The prerequisite list said discrete mathematics, which I had. Almost every proof in the first half is an induction on the number of derivation steps or on the height of a tree, and my previous course had only done induction on integers. Three weeks were spent learning a proof technique the module assumed I arrived with.
AAI Discovery2mo ago
1 person
Only Formal Language Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.