Differences

This shows you the differences between two versions of the page.

--- courses:be4m33pal:lectures [2018/11/19 15:04]
prusapa1 [Lectures 2018 Fall]
+++ courses:be4m33pal:lectures [2018/12/03 10:21]
prusapa1 [Lectures 2018 Fall]
@@ Line 20: / Line 20: @@
 |  **7.**  |  14.11. | Finite automata, indeterminism, regular expressions, exact pattern matching.  | {{:courses:a4m33pal:2011pal07a.pdf| 08a }}\\ {{:courses:a4m33pal:paska08b.pdf| 08b}}\\ | Berezovský  |
 |  **8.**  |  21.11. | Language operations, Approximate pattern matching with finite automata.  | {{:courses:a4m33pal:paska09.pdf|09}} | Průša  |
-|  **9.**  |  28.11. | Dictionary automata. Implementations of automata.  | {{:courses:a4m33pal:paska10.pdf| 10 }}  | Průša |
+|  **9.**  |  28.11. | Dictionary automata. Implementations of automata.  | {{ :courses:be4m33pal:paska10.pdf |  10 }}  | Průša |
 |  **10.**  |  5.12. | Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. | {{:courses:a4m33pal:pal07_2015.pdf| 06}} | Průša  |
 |  **11.**  |  12.12. | Skip list, search trees: B, B+. | {{:courses:a4m33pal:paska11_0.pdf| 11@}} \\ {{:courses:a4m33pal:paska11a.pdf| 11a}} \\ {{:courses:a4m33pal:paska11b.pdf| 11b }} | Průša  |
@@ Line 29: / Line 29: @@
 **Notes**
-Lecture02> {{ :courses:be4m33pal:mst3.pptx |  Minimum Spanning Trees }}
+Lecture02: {{ :courses:be4m33pal:mst3.pptx |  Minimum Spanning Trees }}
 Lecture05: {{:courses:be4m33pal:lesson05_pp31_45.pdf| Gray code and k-subsets}}, {{:courses:be4m33pal:lesson05_pp52_57.pdf| permutations}}.