forked from filipg/djfz-2019
Fix
This commit is contained in:
parent
cfce413fe3
commit
e2e815a9e9
@ -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.
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user