The first exercise is mostly just to remind you of how classes work. The second one asks you to implement a class for FSAs. This will be used in the next homework, where you'll extend it to a class for recursive transition networks with an optional finite bound on the depth of recursion. So if you want to, you can already start thinking about how you'll do this.
Link: https://github.com/StonyBrook-Lin637-S20/homework3 Due: Saturday, April 11, 11:59pm
The first exercise is mostly just to remind you of how classes work. The second one asks you to implement a class for FSAs. This will be used in the next homework, where you'll extend it to a class for recursive transition networks with an optional finite bound on the depth of recursion. So if you want to, you can already start thinking about how you'll do this.