A Concise Tutorial on Finite Automata

• Introduction
• On formal languages
  • On language problems
  • Operations on languages
  • Language specifications
  • Regular languages
• Deterministic finite automata, DFA
  • DFA, an informal description
  • DFA, a mathematical definition
• Nondeterministic finite automata, NDFA
• Equivalence of DFA and NDFA
• Minimum automaton
• On grammars
  • Regular grammars
• Equivalence of regular languages and languages accepted by FA

• To download the software
• To run AUTOMATA from a remote site
• To look at AUTOMATA Manual
  
• To look at a brief AUTOMATA description
  
• To know about AUTOMATA authors
  

Milano COLOS home page