diff --git a/TaskC01/description.txt b/TaskC01/description.txt
index 6102aa1..f18ba99 100644
--- a/TaskC01/description.txt
+++ b/TaskC01/description.txt
@@ -1,7 +1,6 @@
 Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
 Create your own non deterministic FSA description to check whether the string second letter
 from right is 'b'.
-Don't use external files like in TaskF00 (description should be included in run file).
 
 The alphabet is "a", "b", "C"
 
diff --git a/TaskC02/description.txt b/TaskC02/description.txt
index fe9d4aa..94502e7 100644
--- a/TaskC02/description.txt
+++ b/TaskC02/description.txt
@@ -1,7 +1,6 @@
 Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
 Create your own non deterministic FSA description to check whether the string
 ends with "ab"
-Don't use external files like in TaskF00 (description should be included in run file).
 
 The alphabet is "a", "b", "C"
 
diff --git a/TaskC03/description.txt b/TaskC03/description.txt
index 8b96259..edfc437 100644
--- a/TaskC03/description.txt
+++ b/TaskC03/description.txt
@@ -1,7 +1,6 @@
 Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
 Create your own non deterministic FSA description to check whether the string
 contains "abc"
-Don't use external files like in TaskF00 (description should be included in run file).
 
 The alphabet is "a", "b", "c"