Summary
COS3701 Summary.
- Course
- Institution
TERMS: i. FSM: Finite State Machine (Lowest level machine, basic computations) ii. CFL: Context Free Language (Capable of a little higher level computations) iii. TM: Turing Machine (High Level Computations) iv. Undecidable: Problems that cannot be solved by any machine v. Symbol examples: a, ...
[Show more]