COSC 30053 – Automata and Language Theory
Training Classroom
A formal language is a set of strings of symbols drawn from a finite alphabet. A formal language can be specified either by a set of rules such as regular expressions or a context-free grammar that generates the language, or by a formal machine that accepts the language. Automata and Language Theory deals with the concepts formal languages, automaton, grammar, algorithms, computability, decidability, and complexity. The reasons to study automat and language theory is to develop understanding of the students in the formal models in Computer Science, such as finite automata, regular expressions, properties of regular sets, equivalence and minimization of automata, context free grammars, pushdown automata, and Turing machines