Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Introduction Finite Automata
 

Summary: Introduction
Finite Automata
DFA, regular languages
Nondeterminism, NFA, subset construction
Regular Expressions
Syntax, Semantics
Relationship to regular languages
Properties of regular languages
Pumping lemma
Minimizing DFA, Myhill-Nerode theorem
Machines
Modeling hardware in terms of machines
Semantics of interaction, complexity issues
References:
1. "Introduction to Automaton Theory, Languages, and Com-
putation", Hopcroft and Ullman, 1979, Chapters 2,3
2. "Elements of the Theory of Computation", Lewis and Pa-
padimitrou, 1981, Chapters 1,2
Finite Automaton
Arise in various contexts: Text Editors, Neuron modelling,

  

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences