Average Rating
Course Difficulty
Easy 0%
Medium 0%
Hard 100%
Top Course Tags
Great Discussions
Many Small Assignments
Requires Lots of Research
This class was tough.
Course Overview:
This course involves the study of abstract machines and automata, as well as the computational problems that can be solved using them. This makes it highly reccomenadble.
Course highlights:
It is a theory in theoretical computer science, under discrete mathematics (a subject of study in both mathematics and computer science). The word automata (the plural of automaton) comes from the Greek word αὐτόματα, which means "self-acting". The figure at right illustrates a finite-state machine, which belongs to a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the current state and the recent symbol as its inputs.
Hours per week:
12+ hours
Advice for students:
The class needs the seriousness it deserves from a student considering taking the course. Not only, should a student excell in exams but must kearn all the knowledge and skills to be applied in the practical world.