- Dr.(Mrs) A. R. Iyanda
- 'Tunji Odejobi (Course coordinator)
Automata Theory (AT) is concerned with abstract models of computations. Computation can be defined as a set of symbols together with a mechanism for manipulating them with the goal of problem solving. The symbols and machines or mechanisms of focus in AT are abstract. They are abstract because they represent and implement an ideal computation process. In this course, we will examine the AT in the context of computing problem specification, design, modelling, simulation and implementation. This will culminate in an exposition to the theories underpinning computing and their realisation as devices.
Computations can be classified according to the type of symbol being manipulate: numerals, literal or graphical and the procedure underlying it: algorithmic or heuristics. Devices that carry out any form of computation can be conceptualised and formally expressed using Automata Theory (AT). For example, the development (i.e. specification, design, modelling and simulation) of a number of
important computing devices will not be possible without techniques in automata theory. Such devices include:
- Digital circuit;
- Computer memory devices;
- Embedded systems;
- Lexical analyser;
- Spell and grammar checkers;
- Pattern recognisers and
- Machine translation systems; and many more.
In this course therefore, we shall look into the theoretical and practical aspects of Automata Theory with the aim of formalising the ideas and concepts in computational systems development. Students are expected to be familiar with basic concepts of descrete mathematics.
NOTE: CSC622 HAS BEEN MIGRATED TO THE MoodleIFECISRG Electronic Learning Support system
PLEASE REGISTER AND ENROL TO THE COURSE ON THE MoodleIFECISRG web-page