Mathematical Foundation of Computer Science

(Chris Devlin) #1

INTRODUCTION TO LANGUAGES


AND FINITE AUTOMATA


7.1 Basic Concepts of Automata Theory..............................................................................


7.1.1 Alphabets............................................................................................................

7.1.2 Strings.................................................................................................................

7.1.3 Power of Σ

7.1. 4Languages
7.2 Deterministic Finite State Automata (DFA)
7.2.1 Definition
7.2.2 R epresentation of a DFA
7.2.2.1 State Diagram
7.2.2.2 Transition Table
7.2.3 δ-head
7.2.3.1 Definition
7.2.3.2 P roperties of δ-head
7.2. 4Language of a DFA
7.3 Nondeterministic Finite State Automata (NFA)
7.3.1 Definition
7.3.2 Representation
7.3.3 δ-head
7.3. 4Properties of δ-head
7.3.5 L anguage of an NFA
Exercises
Free download pdf