Compare commits
28 Commits
99d7880460
...
60e00a1366
Author | SHA1 | Date |
---|---|---|
Veronika Polevara | 60e00a1366 | |
Veronika Polevara | af19e6039d | |
Veronika Polevara | 7aa19cf544 | |
Veronika Polevara | cba04c64cb | |
Veronika Polevara | b7eaa6209f | |
Veronika Polevara | 70a8f23e6c | |
Veronika Polevara | 9d06315142 | |
Veronika Polevara | b77d5f4b78 | |
Veronika Polevara | 2f1f8b61b2 | |
Veronika Polevara | 24f8a1cceb | |
Veronika Polevara | bcc5dd15cb | |
Veronika Polevara | 53dd677cfb | |
Veronika Polevara | a6545fcaa5 | |
Veronika Polevara | 6be920f80e | |
Veronika Polevara | eece10e455 | |
Veronika Polevara | 6ecd654dea | |
Veronika Polevara | 5fc857b78c | |
Veronika Polevara | 3fd530b13b | |
Veronika Polevara | 3d295d5189 | |
Veronika Polevara | 78e075793b | |
Veronika Polevara | 3da3b1c634 | |
Veronika Polevara | f424d4529c | |
Veronika Polevara | 92b31192b3 | |
Veronika Polevara | ee2341d218 | |
Veronika Polevara | 2d8a843df2 | |
Veronika Polevara | dc2dc557d1 | |
Polevara Veronika | d1bf33f809 | |
Veronika Polevara | 11305777b3 |
|
@ -0,0 +1,14 @@
|
|||
Read a description of a non-deterministic finite-state automaton in the AT&T format
|
||||
(without weights) from the file in the first argument.
|
||||
|
||||
Read strings from the standard input.
|
||||
If a string is accepted by the
|
||||
automaton, write YES, otherwise- write NO.
|
||||
|
||||
The program is invoked like this: python run.py test1.arg < test1.in > test1.out
|
||||
|
||||
Note that not all transitions must be included in description.
|
||||
If no transition is given for the given state and letter, write NO.
|
||||
|
||||
POINTS: 3
|
||||
DEADLINE: 2023-11-12 23:59:59
|
|
@ -0,0 +1,64 @@
|
|||
import sys
|
||||
import copy
|
||||
|
||||
class FSA:
|
||||
|
||||
def __init__(self):
|
||||
self.initial_state = '0'
|
||||
self.final_states = set()
|
||||
|
||||
self.transitions = dict()
|
||||
self.alphabet = set()
|
||||
|
||||
def add_transition(self, state_from, state_to, symbol):
|
||||
|
||||
if state_from in self.transitions.keys():
|
||||
if symbol not in self.transitions[state_from].keys():
|
||||
self.transitions[state_from][symbol] = {state_to}
|
||||
else:
|
||||
self.transitions[state_from][symbol] |= {state_to}
|
||||
else:
|
||||
self.transitions[state_from] = dict()
|
||||
self.transitions[state_from][symbol] = {state_to}
|
||||
|
||||
def add_final_state(self, state):
|
||||
self.final_states.add(state)
|
||||
def get_final_states(self, string):
|
||||
current_states = {self.initial_state}
|
||||
for symbol in string:
|
||||
new_current_states = set()
|
||||
for current_state in current_states:
|
||||
try:
|
||||
new_current_states |= self.transitions[current_state][symbol]
|
||||
except:
|
||||
pass
|
||||
current_states = copy.deepcopy(new_current_states)
|
||||
return current_states
|
||||
|
||||
def accepts(self, string):
|
||||
for final_state in self.get_final_states(string):
|
||||
if final_state in self.final_states:
|
||||
return True
|
||||
return False
|
||||
|
||||
fsa = FSA()
|
||||
|
||||
table = open(sys.argv[1])
|
||||
for line in table:
|
||||
line = line.rstrip()
|
||||
|
||||
if len(line.split('\t')) == 3:
|
||||
a, b, c = line.split('\t')
|
||||
fsa.add_transition(a, b, c)
|
||||
fsa.alphabet.add(c)
|
||||
else:
|
||||
fsa.add_final_state(line)
|
||||
|
||||
|
||||
for line in sys.stdin:
|
||||
line = line.rstrip()
|
||||
|
||||
if fsa.accepts(line):
|
||||
print('YES')
|
||||
else:
|
||||
print('NO')
|
|
@ -0,0 +1,7 @@
|
|||
0 1 a
|
||||
1 0 a
|
||||
1 2 b
|
||||
2 4 c
|
||||
1 3 b
|
||||
3
|
||||
4
|
|
@ -0,0 +1,8 @@
|
|||
YES
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
YES
|
||||
NO
|
||||
YES
|
|
@ -0,0 +1,8 @@
|
|||
abc
|
||||
ab
|
||||
abcd
|
||||
aaaabc
|
||||
aaaaaaaabc
|
||||
aaaaaaabc
|
||||
zzz
|
||||
aaaaaaabc
|
|
@ -0,0 +1,8 @@
|
|||
YES
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
YES
|
||||
NO
|
||||
YES
|
|
@ -0,0 +1,14 @@
|
|||
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"
|
||||
|
||||
Read strings from the standard input.
|
||||
If a string is accepted by the
|
||||
automaton, write YES, otherwise- write NO.
|
||||
|
||||
POINTS: 3
|
||||
DEADLINE: 2023-11-12 23:59:59
|
||||
REMAINDER: 1/3
|
|
@ -0,0 +1,64 @@
|
|||
import sys
|
||||
import copy
|
||||
|
||||
class FSA:
|
||||
|
||||
def __init__(self):
|
||||
self.initial_state = '0'
|
||||
self.final_states = set()
|
||||
|
||||
self.transitions = dict()
|
||||
self.alphabet = set()
|
||||
|
||||
def add_transition(self, state_from, state_to, symbol):
|
||||
|
||||
if state_from in self.transitions.keys():
|
||||
if symbol not in self.transitions[state_from].keys():
|
||||
self.transitions[state_from][symbol] = {state_to}
|
||||
else:
|
||||
self.transitions[state_from][symbol] |= {state_to}
|
||||
else:
|
||||
self.transitions[state_from] = dict()
|
||||
self.transitions[state_from][symbol] = {state_to}
|
||||
|
||||
def add_final_state(self, state):
|
||||
self.final_states.add(state)
|
||||
def get_final_states(self, string):
|
||||
current_states = {self.initial_state}
|
||||
for symbol in string:
|
||||
new_current_states = set()
|
||||
for current_state in current_states:
|
||||
try:
|
||||
new_current_states |= self.transitions[current_state][symbol]
|
||||
except:
|
||||
pass
|
||||
current_states = copy.deepcopy(new_current_states)
|
||||
return current_states
|
||||
|
||||
def accepts(self, string):
|
||||
for final_state in self.get_final_states(string):
|
||||
if final_state in self.final_states:
|
||||
return True
|
||||
return False
|
||||
|
||||
fsa = FSA()
|
||||
|
||||
table = open(sys.argv[1])
|
||||
for line in table:
|
||||
line = line.rstrip()
|
||||
|
||||
if len(line.split('\t')) == 3:
|
||||
a, b, c = line.split('\t')
|
||||
fsa.add_transition(a, b, c)
|
||||
fsa.alphabet.add(c)
|
||||
else:
|
||||
fsa.add_final_state(line)
|
||||
|
||||
|
||||
for line in sys.stdin:
|
||||
line = line.rstrip()
|
||||
|
||||
if fsa.accepts(line):
|
||||
print('YES')
|
||||
else:
|
||||
print('NO')
|
|
@ -0,0 +1,6 @@
|
|||
0 0 a
|
||||
0 0 b
|
||||
0 0 c
|
||||
0 1 a
|
||||
1 2 b
|
||||
2
|
|
@ -0,0 +1,6 @@
|
|||
YES
|
||||
NO
|
||||
YES
|
||||
NO
|
||||
YES
|
||||
NO
|
|
@ -0,0 +1,6 @@
|
|||
ab
|
||||
a
|
||||
abbab
|
||||
bbbbb
|
||||
ababaab
|
||||
b
|
|
@ -0,0 +1,6 @@
|
|||
YES
|
||||
NO
|
||||
YES
|
||||
NO
|
||||
YES
|
||||
NO
|
Loading…
Reference in New Issue