Automata and formal languages are fundamental concepts in Computer Science. Automata are abstract machines that are used for representing computational processes in a mathematically precise fashion. Moreover, any device interacting with the outside world, whether a simple program or a complex system, requires well-defined, formal input and output languages. We will study automata and their relationship with formal languages and grammars.

Sorry, there are no lists here yet. You could try:

  • Clicking My Lists from the menu. Your course enrolled lists are stored here.
  • Searching for the list using the form below:

Lists linked to Automata and Formal Languages

There are currently no lists linked to this Module.