| 
59
 | 
     1  | 
\documentclass{article}
 | 
| 
 | 
     2  | 
\usepackage{charter}
 | 
| 
 | 
     3  | 
\usepackage{hyperref}
 | 
| 
 | 
     4  | 
\usepackage{amssymb}
 | 
| 
 | 
     5  | 
\usepackage{amsmath}
 | 
| 
 | 
     6  | 
\usepackage{tikz}
 | 
| 
 | 
     7  | 
\usetikzlibrary{automata}
 | 
| 
 | 
     8  | 
  | 
| 
 | 
     9  | 
\newcommand{\dn}{\stackrel{\mbox{\scriptsize def}}{=}}% for definitions
 | 
| 
 | 
    10  | 
  | 
| 
 | 
    11  | 
\begin{document}
 | 
| 
 | 
    12  | 
  | 
| 
 | 
    13  | 
\noindent
  | 
| 
 | 
    14  | 
{\bf \underline{Non-exhaustive} list of topics you should know for the exam!}
 | 
| 
 | 
    15  | 
  | 
| 
 | 
    16  | 
\section{Sets}
 | 
| 
 | 
    17  | 
  | 
| 
 | 
    18  | 
\begin{itemize}
 | 
| 
 | 
    19  | 
\item What is a language?
  | 
| 
60
 | 
    20  | 
\item concatenation of two sets of strings
  | 
| 
59
 | 
    21  | 
\item power of a set of strings
  | 
| 
 | 
    22  | 
\end{itemize}
 | 
| 
 | 
    23  | 
  | 
| 
 | 
    24  | 
\section{Regular Expressions}
 | 
| 
 | 
    25  | 
  | 
| 
 | 
    26  | 
\begin{itemize}
 | 
| 
60
 | 
    27  | 
\item definition of regular expressions
  | 
| 
59
 | 
    28  | 
\item What is the language of a regular expression?
  | 
| 
 | 
    29  | 
\item When are two regular expressions are equal?
  | 
| 
 | 
    30  | 
\item {\it nullable}, {\it der}, {\it zeroable}, {\it rev}
 | 
| 
 | 
    31  | 
\item induction principle of regular expressions
  | 
| 
 | 
    32  | 
\item tokens, maximal munch rule
  | 
| 
60
 | 
    33  | 
\item regular expression for complement language 
  | 
| 
59
 | 
    34  | 
\item tokenisation
  | 
| 
 | 
    35  | 
\end{itemize}
 | 
| 
 | 
    36  | 
  | 
| 
 | 
    37  | 
\section{Automata}
 | 
| 
 | 
    38  | 
  | 
| 
 | 
    39  | 
\begin{itemize}
 | 
| 
 | 
    40  | 
\item DFA, NFA
  | 
| 
 | 
    41  | 
\item What is the language recognised by a DFA?
  | 
| 
 | 
    42  | 
\item Reg $\rightarrow$ NFA
  | 
| 
 | 
    43  | 
\item NFA $\rightarrow$ DFA (subset construction)
  | 
| 
 | 
    44  | 
\item DFA minimisation (Hopcroft's algorithm)
  | 
| 
 | 
    45  | 
\item complement DFA 
  | 
| 
 | 
    46  | 
\item completion of an automaton
  | 
| 
 | 
    47  | 
\item DFA $\rightarrow$ Reg (Brzozowsky's algorithm, equational systems, Arden's lemma)
  | 
| 
 | 
    48  | 
\end{itemize}
 | 
| 
 | 
    49  | 
  | 
| 
 | 
    50  | 
\section{Grammars}
 | 
| 
 | 
    51  | 
  | 
| 
 | 
    52  | 
\begin{itemize}
 | 
| 
 | 
    53  | 
\item ambiguous grammars 
  | 
| 
 | 
    54  | 
\item parse trees
  | 
| 
 | 
    55  | 
\item ASTs
  | 
| 
 | 
    56  | 
\item CYK algorithm
  | 
| 
 | 
    57  | 
\end{itemize}
 | 
| 
 | 
    58  | 
  | 
| 
 | 
    59  | 
\end{document}
 | 
| 
 | 
    60  | 
  | 
| 
 | 
    61  | 
%%% Local Variables: 
  | 
| 
 | 
    62  | 
%%% mode: latex
  | 
| 
 | 
    63  | 
%%% TeX-master: t
  | 
| 
 | 
    64  | 
%%% End: 
  |