|
33
|
1 |
\documentclass[dvipsnames,14pt,t]{beamer}
|
|
|
2 |
\usepackage{beamerthemeplainculight}
|
|
|
3 |
\usepackage[T1]{fontenc}
|
|
|
4 |
\usepackage[latin1]{inputenc}
|
|
|
5 |
\usepackage{mathpartir}
|
|
|
6 |
\usepackage[absolute,overlay]{textpos}
|
|
|
7 |
\usepackage{ifthen}
|
|
|
8 |
\usepackage{tikz}
|
|
|
9 |
\usepackage{pgf}
|
|
|
10 |
\usepackage{calc}
|
|
|
11 |
\usepackage{ulem}
|
|
|
12 |
\usepackage{courier}
|
|
|
13 |
\usepackage{listings}
|
|
|
14 |
\renewcommand{\uline}[1]{#1}
|
|
|
15 |
\usetikzlibrary{arrows}
|
|
|
16 |
\usetikzlibrary{automata}
|
|
|
17 |
\usetikzlibrary{shapes}
|
|
|
18 |
\usetikzlibrary{shadows}
|
|
|
19 |
\usetikzlibrary{positioning}
|
|
|
20 |
\usetikzlibrary{calc}
|
|
|
21 |
\usepackage{graphicx}
|
|
|
22 |
|
|
|
23 |
\definecolor{javared}{rgb}{0.6,0,0} % for strings
|
|
|
24 |
\definecolor{javagreen}{rgb}{0.25,0.5,0.35} % comments
|
|
|
25 |
\definecolor{javapurple}{rgb}{0.5,0,0.35} % keywords
|
|
|
26 |
\definecolor{javadocblue}{rgb}{0.25,0.35,0.75} % javadoc
|
|
|
27 |
|
|
|
28 |
\lstset{language=Java,
|
|
|
29 |
basicstyle=\ttfamily,
|
|
|
30 |
keywordstyle=\color{javapurple}\bfseries,
|
|
|
31 |
stringstyle=\color{javagreen},
|
|
|
32 |
commentstyle=\color{javagreen},
|
|
|
33 |
morecomment=[s][\color{javadocblue}]{/**}{*/},
|
|
|
34 |
numbers=left,
|
|
|
35 |
numberstyle=\tiny\color{black},
|
|
|
36 |
stepnumber=1,
|
|
|
37 |
numbersep=10pt,
|
|
|
38 |
tabsize=2,
|
|
|
39 |
showspaces=false,
|
|
|
40 |
showstringspaces=false}
|
|
|
41 |
|
|
|
42 |
\lstdefinelanguage{scala}{
|
|
|
43 |
morekeywords={abstract,case,catch,class,def,%
|
|
|
44 |
do,else,extends,false,final,finally,%
|
|
|
45 |
for,if,implicit,import,match,mixin,%
|
|
|
46 |
new,null,object,override,package,%
|
|
|
47 |
private,protected,requires,return,sealed,%
|
|
|
48 |
super,this,throw,trait,true,try,%
|
|
|
49 |
type,val,var,while,with,yield},
|
|
|
50 |
otherkeywords={=>,<-,<\%,<:,>:,\#,@},
|
|
|
51 |
sensitive=true,
|
|
|
52 |
morecomment=[l]{//},
|
|
|
53 |
morecomment=[n]{/*}{*/},
|
|
|
54 |
morestring=[b]",
|
|
|
55 |
morestring=[b]',
|
|
|
56 |
morestring=[b]"""
|
|
|
57 |
}
|
|
|
58 |
|
|
|
59 |
\lstset{language=Scala,
|
|
|
60 |
basicstyle=\ttfamily,
|
|
|
61 |
keywordstyle=\color{javapurple}\bfseries,
|
|
|
62 |
stringstyle=\color{javagreen},
|
|
|
63 |
commentstyle=\color{javagreen},
|
|
|
64 |
morecomment=[s][\color{javadocblue}]{/**}{*/},
|
|
|
65 |
numbers=left,
|
|
|
66 |
numberstyle=\tiny\color{black},
|
|
|
67 |
stepnumber=1,
|
|
|
68 |
numbersep=10pt,
|
|
|
69 |
tabsize=2,
|
|
|
70 |
showspaces=false,
|
|
|
71 |
showstringspaces=false}
|
|
|
72 |
|
|
|
73 |
% beamer stuff
|
|
|
74 |
\renewcommand{\slidecaption}{AFL 04, King's College London, 17.~October 2012}
|
|
|
75 |
\newcommand{\bl}[1]{\textcolor{blue}{#1}}
|
|
|
76 |
\newcommand{\dn}{\stackrel{\mbox{\scriptsize def}}{=}}% for definitions
|
|
|
77 |
|
|
|
78 |
\begin{document}
|
|
|
79 |
|
|
|
80 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
81 |
\mode<presentation>{
|
|
|
82 |
\begin{frame}<1>[t]
|
|
|
83 |
\frametitle{%
|
|
|
84 |
\begin{tabular}{@ {}c@ {}}
|
|
|
85 |
\\[-3mm]
|
|
|
86 |
\LARGE Automata and \\[-2mm]
|
|
|
87 |
\LARGE Formal Languages (4)\\[3mm]
|
|
|
88 |
\end{tabular}}
|
|
|
89 |
|
|
|
90 |
\normalsize
|
|
|
91 |
\begin{center}
|
|
|
92 |
\begin{tabular}{ll}
|
|
|
93 |
Email: & christian.urban at kcl.ac.uk\\
|
|
|
94 |
Of$\!$fice: & S1.27 (1st floor Strand Building)\\
|
|
|
95 |
Slides: & KEATS (also home work is there)\\
|
|
|
96 |
\end{tabular}
|
|
|
97 |
\end{center}
|
|
|
98 |
|
|
|
99 |
|
|
|
100 |
\end{frame}}
|
|
|
101 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
102 |
|
|
|
103 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
104 |
\mode<presentation>{
|
|
|
105 |
\begin{frame}[c]
|
|
|
106 |
\frametitle{\begin{tabular}{c}Last Week\end{tabular}}
|
|
|
107 |
|
|
|
108 |
Last week I showed you
|
|
|
109 |
|
|
|
110 |
\begin{itemize}
|
|
|
111 |
\item tokenizer
|
|
|
112 |
|
|
|
113 |
\item tokenization identifies lexeme in an input stream of characters (or string)
|
|
|
114 |
and categorizes them into tokens
|
|
|
115 |
|
|
34
|
116 |
\item longest match rule (maximal munch rule): The
|
|
|
117 |
longest initial substring matched by any regular expression is taken
|
|
|
118 |
as next token.
|
|
|
119 |
|
|
|
120 |
\item Rule priority:
|
|
|
121 |
For a particular longest initial substring, the first regular
|
|
|
122 |
expression that can match determines the token.
|
|
|
123 |
|
|
|
124 |
\item problem with infix operations, for example i-12
|
|
33
|
125 |
\end{itemize}
|
|
|
126 |
|
|
|
127 |
\url{http://www.technologyreview.com/tr10/?year=2011}
|
|
|
128 |
|
|
34
|
129 |
finite deterministic automata/ nondeterministic automaton
|
|
|
130 |
|
|
|
131 |
|
|
|
132 |
|
|
33
|
133 |
\end{frame}}
|
|
|
134 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
135 |
|
|
|
136 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
137 |
\mode<presentation>{
|
|
|
138 |
\begin{frame}[c]
|
|
|
139 |
\frametitle{\begin{tabular}{c}The Derivative of a Rexp\end{tabular}}
|
|
|
140 |
|
|
|
141 |
\begin{center}
|
|
|
142 |
\begin{tabular}{@ {}l@ {\hspace{2mm}}c@ {\hspace{2mm}}l@ {\hspace{-10mm}}l@ {}}
|
|
|
143 |
\bl{der c ($\varnothing$)} & \bl{$\dn$} & \bl{$\varnothing$} & \\
|
|
|
144 |
\bl{der c ($\epsilon$)} & \bl{$\dn$} & \bl{$\varnothing$} & \\
|
|
|
145 |
\bl{der c (d)} & \bl{$\dn$} & \bl{if c $=$ d then $\epsilon$ else $\varnothing$} & \\
|
|
|
146 |
\bl{der c (r$_1$ + r$_2$)} & \bl{$\dn$} & \bl{(der c r$_1$) + (der c r$_2$)} & \\
|
|
|
147 |
\bl{der c (r$_1$ $\cdot$ r$_2$)} & \bl{$\dn$} & \bl{if nullable r$_1$}\\
|
|
|
148 |
& & \bl{then ((der c r$_1$) $\cdot$ r$_2$) + (der c r$_2$)}\\
|
|
|
149 |
& & \bl{else (der c r$_1$) $\cdot$ r$_2$}\\
|
|
|
150 |
\bl{der c (r$^*$)} & \bl{$\dn$} & \bl{(der c r) $\cdot$ (r$^*$)}\\
|
|
|
151 |
\end{tabular}
|
|
|
152 |
\end{center}
|
|
|
153 |
|
|
|
154 |
``the regular expression after \bl{c} has been recognised''
|
|
|
155 |
|
|
|
156 |
\end{frame}}
|
|
|
157 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
158 |
|
|
|
159 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
160 |
\mode<presentation>{
|
|
|
161 |
\begin{frame}[c]
|
|
|
162 |
|
|
|
163 |
For this we defined the set \bl{Der c A} as
|
|
|
164 |
|
|
|
165 |
\begin{center}
|
|
|
166 |
\bl{Der c A $\dn$ $\{$ s $|$ c::s $\in$ A$\}$ }
|
|
|
167 |
\end{center}
|
|
|
168 |
|
|
|
169 |
which is called the semantic derivative of a set
|
|
|
170 |
and proved
|
|
|
171 |
|
|
|
172 |
\begin{center}
|
|
|
173 |
\bl{$L$(der c r) $=$ Der c ($L$(r))}
|
|
|
174 |
\end{center}
|
|
|
175 |
|
|
|
176 |
|
|
|
177 |
\end{frame}}
|
|
|
178 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
179 |
|
|
|
180 |
|
|
|
181 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
182 |
\mode<presentation>{
|
|
|
183 |
\begin{frame}[c]
|
|
|
184 |
\frametitle{\begin{tabular}{c}The Idea of the Algorithm\end{tabular}}
|
|
|
185 |
|
|
|
186 |
If we want to recognise the string \bl{abc} with regular expression \bl{r}
|
|
|
187 |
then\medskip
|
|
|
188 |
|
|
|
189 |
\begin{enumerate}
|
|
|
190 |
\item \bl{Der a ($L$(r))}\pause
|
|
|
191 |
\item \bl{Der b (Der a ($L$(r)))}
|
|
|
192 |
\item \bl{Der c (Der b (Der a ($L$(r))))}\pause
|
|
|
193 |
\item finally we test whether the empty string is in set\pause\medskip
|
|
|
194 |
\end{enumerate}
|
|
|
195 |
|
|
|
196 |
The matching algorithm works similarly, just over regular expression than sets.
|
|
|
197 |
\end{frame}}
|
|
|
198 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
199 |
|
|
|
200 |
|
|
|
201 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
202 |
\mode<presentation>{
|
|
|
203 |
\begin{frame}[c]
|
|
|
204 |
|
|
|
205 |
Input: string \bl{abc} and regular expression \bl{r}
|
|
|
206 |
|
|
|
207 |
\begin{enumerate}
|
|
|
208 |
\item \bl{der a r}
|
|
|
209 |
\item \bl{der b (der a r)}
|
|
|
210 |
\item \bl{der c (der b (der a r))}\pause
|
|
|
211 |
\item finally check whether the latter regular expression can match the empty string
|
|
|
212 |
\end{enumerate}
|
|
|
213 |
|
|
|
214 |
\end{frame}}
|
|
|
215 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
216 |
|
|
|
217 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
218 |
\mode<presentation>{
|
|
|
219 |
\begin{frame}[c]
|
|
|
220 |
|
|
|
221 |
We need to prove
|
|
|
222 |
|
|
|
223 |
\begin{center}
|
|
|
224 |
\bl{$L$(der c r) $=$ Der c ($L$(r))}
|
|
|
225 |
\end{center}
|
|
|
226 |
|
|
|
227 |
by induction on the regular expression.
|
|
|
228 |
|
|
|
229 |
\end{frame}}
|
|
|
230 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
231 |
|
|
|
232 |
|
|
|
233 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
234 |
\mode<presentation>{
|
|
|
235 |
\begin{frame}[c]
|
|
|
236 |
\frametitle{\begin{tabular}{c}Proofs about Rexp\end{tabular}}
|
|
|
237 |
|
|
|
238 |
\begin{itemize}
|
|
|
239 |
\item \bl{$P$} holds for \bl{$\varnothing$}, \bl{$\epsilon$} and \bl{c}\bigskip
|
|
|
240 |
\item \bl{$P$} holds for \bl{r$_1$ + r$_2$} under the assumption that \bl{$P$} already
|
|
|
241 |
holds for \bl{r$_1$} and \bl{r$_2$}.\bigskip
|
|
|
242 |
\item \bl{$P$} holds for \bl{r$_1$ $\cdot$ r$_2$} under the assumption that \bl{$P$} already
|
|
|
243 |
holds for \bl{r$_1$} and \bl{r$_2$}.
|
|
|
244 |
\item \bl{$P$} holds for \bl{r$^*$} under the assumption that \bl{$P$} already
|
|
|
245 |
holds for \bl{r}.
|
|
|
246 |
\end{itemize}
|
|
|
247 |
|
|
|
248 |
\end{frame}}
|
|
|
249 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
250 |
|
|
|
251 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
252 |
\mode<presentation>{
|
|
|
253 |
\begin{frame}[c]
|
|
|
254 |
\frametitle{\begin{tabular}{c}Proofs about Natural Numbers\\ and Strings\end{tabular}}
|
|
|
255 |
|
|
|
256 |
\begin{itemize}
|
|
|
257 |
\item \bl{$P$} holds for \bl{$0$} and
|
|
|
258 |
\item \bl{$P$} holds for \bl{$n + 1$} under the assumption that \bl{$P$} already
|
|
|
259 |
holds for \bl{$n$}
|
|
|
260 |
\end{itemize}\bigskip
|
|
|
261 |
|
|
|
262 |
\begin{itemize}
|
|
|
263 |
\item \bl{$P$} holds for \bl{\texttt{""}} and
|
|
|
264 |
\item \bl{$P$} holds for \bl{$c\!::\!s$} under the assumption that \bl{$P$} already
|
|
|
265 |
holds for \bl{$s$}
|
|
|
266 |
\end{itemize}
|
|
|
267 |
|
|
|
268 |
\end{frame}}
|
|
|
269 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
270 |
|
|
|
271 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
272 |
\mode<presentation>{
|
|
|
273 |
\begin{frame}[t]
|
|
|
274 |
\frametitle{\begin{tabular}{c}Regular Expressions\end{tabular}}
|
|
|
275 |
|
|
|
276 |
\begin{center}
|
|
|
277 |
\begin{tabular}{@ {}rrl@ {\hspace{13mm}}l}
|
|
|
278 |
\bl{r} & \bl{$::=$} & \bl{$\varnothing$} & null\\
|
|
|
279 |
& \bl{$\mid$} & \bl{$\epsilon$} & empty string / "" / []\\
|
|
|
280 |
& \bl{$\mid$} & \bl{c} & character\\
|
|
|
281 |
& \bl{$\mid$} & \bl{r$_1$ $\cdot$ r$_2$} & sequence\\
|
|
|
282 |
& \bl{$\mid$} & \bl{r$_1$ + r$_2$} & alternative / choice\\
|
|
|
283 |
& \bl{$\mid$} & \bl{r$^*$} & star (zero or more)\\
|
|
|
284 |
\end{tabular}\bigskip\pause
|
|
|
285 |
\end{center}
|
|
|
286 |
|
|
|
287 |
\end{frame}}
|
|
|
288 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
289 |
|
|
|
290 |
|
|
|
291 |
|
|
|
292 |
|
|
|
293 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
294 |
\mode<presentation>{
|
|
|
295 |
\begin{frame}[c]
|
|
|
296 |
\frametitle{\begin{tabular}{c}Languages\end{tabular}}
|
|
|
297 |
|
|
|
298 |
A \alert{language} is a set of strings.\bigskip
|
|
|
299 |
|
|
|
300 |
A \alert{regular expression} specifies a set of strings or language.\bigskip
|
|
|
301 |
|
|
|
302 |
A language is \alert{regular} iff there exists
|
|
|
303 |
a regular expression that recognises all its strings.\bigskip\bigskip\pause
|
|
|
304 |
|
|
|
305 |
\textcolor{gray}{not all languages are regular, e.g.~\bl{a$^n$b$^n$}.}
|
|
|
306 |
\end{frame}}
|
|
|
307 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
308 |
|
|
|
309 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
310 |
\mode<presentation>{
|
|
|
311 |
\begin{frame}[t]
|
|
|
312 |
\frametitle{\begin{tabular}{c}Regular Expressions\end{tabular}}
|
|
|
313 |
|
|
|
314 |
\begin{center}
|
|
|
315 |
\begin{tabular}{@ {}rrl@ {\hspace{13mm}}l}
|
|
|
316 |
\bl{r} & \bl{$::=$} & \bl{$\varnothing$} & null\\
|
|
|
317 |
& \bl{$\mid$} & \bl{$\epsilon$} & empty string / "" / []\\
|
|
|
318 |
& \bl{$\mid$} & \bl{c} & character\\
|
|
|
319 |
& \bl{$\mid$} & \bl{r$_1$ $\cdot$ r$_2$} & sequence\\
|
|
|
320 |
& \bl{$\mid$} & \bl{r$_1$ + r$_2$} & alternative / choice\\
|
|
|
321 |
& \bl{$\mid$} & \bl{r$^*$} & star (zero or more)\\
|
|
|
322 |
\end{tabular}\bigskip
|
|
|
323 |
\end{center}
|
|
|
324 |
|
|
|
325 |
How about ranges \bl{[a-z]}, \bl{r$^\text{+}$} and \bl{!r}?
|
|
|
326 |
|
|
|
327 |
\end{frame}}
|
|
|
328 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
329 |
|
|
|
330 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
331 |
\mode<presentation>{
|
|
|
332 |
\begin{frame}[c]
|
|
|
333 |
\frametitle{\begin{tabular}{c}Negation of Regular Expr's\end{tabular}}
|
|
|
334 |
|
|
|
335 |
\begin{itemize}
|
|
|
336 |
\item \bl{!r} \hspace{6mm} (everything that \bl{r} cannot recognise)\medskip
|
|
|
337 |
\item \bl{$L$(!r) $\dn$ UNIV - $L$(r)}\medskip
|
|
|
338 |
\item \bl{nullable (!r) $\dn$ not (nullable(r))}\medskip
|
|
|
339 |
\item \bl{der\,c\,(!r) $\dn$ !(der\,c\,r)}
|
|
|
340 |
\end{itemize}
|
|
|
341 |
|
|
|
342 |
\end{frame}}
|
|
|
343 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
344 |
|
|
|
345 |
|
|
|
346 |
|
|
|
347 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
348 |
\mode<presentation>{
|
|
|
349 |
\begin{frame}[c]
|
|
|
350 |
\frametitle{\begin{tabular}{c}Regular Exp's for Lexing\end{tabular}}
|
|
|
351 |
|
|
|
352 |
Lexing separates strings into ``words'' / components.
|
|
|
353 |
|
|
|
354 |
\begin{itemize}
|
|
|
355 |
\item Identifiers (non-empty strings of letters or digits, starting with a letter)
|
|
|
356 |
\item Numbers (non-empty sequences of digits omitting leading zeros)
|
|
|
357 |
\item Keywords (else, if, while, \ldots)
|
|
|
358 |
\item White space (a non-empty sequence of blanks, newlines and tabs)
|
|
|
359 |
\item Comments
|
|
|
360 |
\end{itemize}
|
|
|
361 |
|
|
|
362 |
\end{frame}}
|
|
|
363 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
364 |
|
|
|
365 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
366 |
\mode<presentation>{
|
|
|
367 |
\begin{frame}[c]
|
|
|
368 |
\frametitle{\begin{tabular}{c}Automata\end{tabular}}
|
|
|
369 |
|
|
|
370 |
A deterministic finite automaton consists of:
|
|
|
371 |
|
|
|
372 |
\begin{itemize}
|
|
|
373 |
\item a set of states
|
|
|
374 |
\item one of these states is the start state
|
|
|
375 |
\item some states are accepting states, and
|
|
|
376 |
\item there is transition function\medskip
|
|
|
377 |
|
|
|
378 |
\small
|
|
|
379 |
which takes a state as argument and a character and produces a new state\smallskip\\
|
|
|
380 |
this function might not always be defined
|
|
|
381 |
\end{itemize}
|
|
|
382 |
|
|
|
383 |
\end{frame}}
|
|
|
384 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
385 |
|
|
|
386 |
|
|
|
387 |
\end{document}
|
|
|
388 |
|
|
|
389 |
%%% Local Variables:
|
|
|
390 |
%%% mode: latex
|
|
|
391 |
%%% TeX-master: t
|
|
|
392 |
%%% End:
|
|
|
393 |
|