1014 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

  1015 \mode<presentation>{

  1016 \begin{frame}[c]

  1017 \frametitle{\begin{tabular}{c}Regular Expressions\end{tabular}}

  1018 

  1019 \begin{itemize}

  1020 \item symbols, digits

  1021 \item identifiers

  1022 \item numbers (non-leading zeros)

  1023 \item keywords

  1024 \item comments

  1025 \end{itemize}\bigskip

  1026 

  1027 

  1028 \mbox{}\hfill\bl{\url{http://www.regexper.com}}

  1029 \end{frame}}

  1030 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   

  1031 

  1032 

  1033 

  1034 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

  1035 \mode<presentation>{

  1036 \begin{frame}[c]

  1037 \frametitle{\begin{tabular}{c}Regular Languages\end{tabular}}

  1038 

  1039 A language (a set of strings) is \alert{regular} iff there exists

  1040 a regular expression that recognises all its strings.\bigskip\bigskip\pause

  1041 

  1042 

  1043 Do you think there are languages that are {\bf not} regular?

  1044 \end{frame}}

  1045 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   

  1046 

  1047 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

  1048 \mode<presentation>{

  1049 \begin{frame}[c]

  1050 \frametitle{\begin{tabular}{c}Automata\end{tabular}}

  1051 

  1052 A deterministic finite automaton consists of:

  1053 

  1054 \begin{itemize}

  1055 \item a set of states

  1056 \item one of these states is the start state

  1057 \item some states are accepting states, and

  1058 \item there is transition function\medskip 

  1059 

  1060 \small

  1061 which takes a state as argument and a character and produces a new state\smallskip\\

  1062 this function might not always be defined

  1063 \end{itemize}

  1064 

  1065 \end{frame}}

  1066 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   

  1067 

  1068 

  1069