s439415
/
djfz-2019-s439415
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix

This commit is contained in:
Filip Graliński 2019-12-10 15:07:39 +01:00
parent cfce413fe3
commit e2e815a9e9
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
TaskB01/description.txt
View File

@ -4,8 +4,8 @@ Deterministic automaton II
Read a description of a finite-state automaton in the AT&T format Read a description of a finite-state automaton in the AT&T format
(without weights) from the standard input. Then, read strings from the (without weights) from the standard input. Then, read strings from the
file whose name was given as the first argument. If a string is 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 accepted by the automated, write TRUE, a space and the string on the
standard output, otherwise — write NO, a space and the string. 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. If there is a non-determinism in the automaton, the first transition should be chosen.