3.11 Problem: Finite State Machines

Implement a reduction relation that executes a given finite-state machine with a given initial state on a given input sequence. Your representation for finite-state machine should accommodate a non-deterministic set of transition rules.

Challenge Implement a metafunction that converts a non-deterministic machine to a deterministic one.

top ← prev up next →

1	Amb: A Redex Tutorial
2	Long Tutorial
3	Extended Exercises
4	The Redex Reference
5	Automated Testing Benchmark
	Bibliography
	Index

3.1	Problem: Objects
3.2	Solution: Objects
3.3	Problem: Types
3.4	Solution: Types
3.5	Problem: Missionaries and Cannibals
3.6	Solution: Missionaries and Cannibals
3.7	Problem: Towers of Hanoi
3.8	Solution: Towers of Hanoi
3.9	Problem: GC
3.10	Solution: GC
3.11	Problem: Finite State Machines
3.12	Solution: Finite State Machines
3.13	Problem: Threads
3.14	Solution: Threads
3.15	Problem: Contracts
3.16	Solution: Contracts
3.17	Problem: Binary Addition
3.18	Solution: Binary Addition