1. Transition diagrams Each state is a node For each state q ∈ Q and each symbol a ∈ Σ, let δ(q,a) = p Then the transition diagram has an arc from q to p, labeled a There is an arrow to the start state q0 Nodes corresponding to ﬁnal states are marked with doubled circle 2. Transition tables Tabular representation of a function We can verify that the string ababa is accepted by this NFA once we "guess" the state path q0,q2,q5,q2,q5,q2 ∈ F.Of course the only choice is the first one. If we made the wrong start q0,q1,q3,q4,q1 we reach a point where we have a remaining a symbol to process with no place to go.

*A state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems. State diagrams require that the system described is composed of a finite number of states; sometimes, this is indeed the case, while at other times this is a reasonable abstraction.*diagram of the DFA a Generalized Transition Graph (GTG). This part was very complex to create as an interactive tool. We limited the interaction, because it was too tedious for the user to enter in each regular expression. However, we wanted the user to be able to focus in Drawing Finite State Machines in LATEX using tikz A Tutorial Satyaki Sikdar [email protected] August 31, 2017 1 Introduction Paraphrasing from [beg14], LATEX (pronounced lay-tek) is an open-source, multiplatform document prepa- Deterministic Finite Automata (DFA ) • DFAs are easiest to present pictorially: Q 0 Q 1 Q 2 1 . 1 . 0 0 0,1 . They are directed graphs whose nodes are states and whose arcs are labeled by one or more symbols from some alphabet Σ. Here Σ is {0,1}. Such a graph is called a state transition diagram. Homework 1, Due Tuesday 02/06. Draw the transition diagram for a DFA D 1 for the language: L 1 = { w ∈ {0,1} * | w does not contain the substring 11 }.. Prove that your DFA D 1 does indeed recognize L 1.