TOC

Seite 1

Automata:

-> machine without output

a) Deterministic finite automata (DFA)

b) Non deterministic finite automata (NFA)

DFA: IF a string belongs to a lang., then it gets accepted and rejected if otherwise

state: one start, one or more accepting (represented by q)

start state (q0) : It has an incoming edge. Only one start state

accepting state: One circle within other circle.

Seite 2