From e2e815a9e95e5591971d40b3f9fc4ee230e93a5f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Tue, 10 Dec 2019 15:07:39 +0100 Subject: [PATCH] Fix --- TaskB01/description.txt | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/TaskB01/description.txt b/TaskB01/description.txt index 7e13d5c..5d94363 100644 --- a/TaskB01/description.txt +++ b/TaskB01/description.txt @@ -4,8 +4,8 @@ Deterministic automaton II Read a description of a finite-state automaton in the AT&T format (without weights) from the standard input. Then, read strings from the file whose name was given as the first argument. If a string is -accepted by the automated, write YES, a space and the string on the -standard output, otherwise — write NO, a space and the string. +accepted by the automated, write TRUE, a space and the string on the +standard output, otherwise — write FALSE, a space and the string. If there is a non-determinism in the automaton, the first transition should be chosen.