|
0
|
1 |
\documentclass{article}
|
|
|
2 |
\usepackage{charter}
|
|
|
3 |
\usepackage{hyperref}
|
|
9
|
4 |
\usepackage{amssymb}
|
|
0
|
5 |
|
|
|
6 |
\begin{document}
|
|
|
7 |
|
|
|
8 |
\section*{Homework 1}
|
|
|
9 |
|
|
|
10 |
\begin{enumerate}
|
|
12
|
11 |
\item {\bf (Optional)} If you want to run the code presented
|
|
|
12 |
in the lectures, install the
|
|
9
|
13 |
Scala programming language available (for free) from
|
|
0
|
14 |
\begin{center}
|
|
|
15 |
\url{http://www.scala-lang.org}
|
|
|
16 |
\end{center}
|
|
|
17 |
|
|
9
|
18 |
\item {\bf (Optional)} Have a look at the crawler programs.
|
|
|
19 |
Can you find a usage for them in your daily programming life?
|
|
0
|
20 |
|
|
12
|
21 |
\item In the context of the AFL-course, what is meant by the term \emph{language}?
|
|
9
|
22 |
|
|
|
23 |
\item Give the definition for regular expressions. What is the meaning of a
|
|
|
24 |
regular expression?
|
|
0
|
25 |
|
|
9
|
26 |
\item Assume the concatenation operation of two strings is written as $s_1 @ s_2$.
|
|
|
27 |
Define the operation of \emph{concatenating} two sets of strings.
|
|
0
|
28 |
|
|
9
|
29 |
\item How is the power of a language defined? (Hint: There are two rules, one for $\_\!\_^0$ and
|
|
|
30 |
one for $\_\!\_^{n+1}$.)
|
|
0
|
31 |
|
|
9
|
32 |
\item Given the regular expressions $r_1 = \epsilon$ and $r_2 = \varnothing$ and $r_3 = a$.
|
|
|
33 |
How many strings can the regular expressions $r_1^*$, $r_2^*$ and $r_3^*$ each match?
|
|
0
|
34 |
|
|
|
35 |
\end{enumerate}
|
|
|
36 |
|
|
|
37 |
\end{document}
|
|
|
38 |
|
|
|
39 |
%%% Local Variables:
|
|
|
40 |
%%% mode: latex
|
|
|
41 |
%%% TeX-master: t
|
|
|
42 |
%%% End:
|