# HG changeset patch
# User Christian Urban <urbanc@in.tum.de>
# Date 1570737878 -3600
# Node ID b090c07b7904b533874c9f3236c8e3ba0b9715a1
# Parent  d600bb069ab3438675edfc30fdadbc5c8db86732
updated

diff -r d600bb069ab3 -r b090c07b7904 hws/hw03.pdf
Binary file hws/hw03.pdf has changed
diff -r d600bb069ab3 -r b090c07b7904 hws/hw03.tex
--- a/hws/hw03.tex	Thu Oct 10 10:43:03 2019 +0100
+++ b/hws/hw03.tex	Thu Oct 10 21:04:38 2019 +0100
@@ -120,7 +120,7 @@
     \end{tikzpicture}
   \end{center}
 
-\item \textbf{(Deleted for 2017, 2018)}
+\item \textbf{(Deleted for 2017, 2018, 2019)}
   Given the following deterministic finite automaton over the
   alphabet $\{0, 1\}$, find the corresponding minimal automaton. In
   case states can be merged, state clearly which states can be merged.
diff -r d600bb069ab3 -r b090c07b7904 progs/nfa.scala
--- a/progs/nfa.scala	Thu Oct 10 10:43:03 2019 +0100
+++ b/progs/nfa.scala	Thu Oct 10 21:04:38 2019 +0100
@@ -89,3 +89,4 @@
 subset(nfa1).accepts("aaaaabbb".toList)       // true
 subset(nfa1).accepts("aaaaabbbaaa".toList)    // false
 subset(nfa1).accepts("ac".toList)             // false
+