zadania b00,b01

README.md

@@ -1,6 +1,11 @@
 
 ## Zajęcia 1
 
+Copyright AMU Poznan
+
+Made by multiple people 
+
+
 ### Informacje na temat przedmiotu
 
 Prowadzący: Jacek Kałużny

TaskB00/description.txt

@@ -0,0 +1,8 @@
+Read a description of a 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: ./run.py fsa_description.arg < test1.in > test1.out

TaskB00/fsa_description.arg

@@ -0,0 +1,16 @@
+0	1	x
+1	2	y
+2	3	z
+0	4	y
+0	4	z
+1	4	x
+1	4	z
+2	4	x
+2	4	y
+3	4	x
+3	4	y
+3	4	z
+4	4	x
+4	4	y
+4	4	z
+3

TaskB00/run.py

@@ -0,0 +1,26 @@
+import sys
+
+def is_accepted(fsa, input_string):
+    current_state = 0
+    for symbol in input_string:
+        if (current_state, symbol) in fsa:
+            current_state = fsa[(current_state, symbol)]
+        else:
+            return False
+    return current_state == 4
+
+fsa_file = sys.argv[1]
+fsa = {}
+with open(fsa_file, 'r') as f:
+    for line in f:
+        parts = line.strip().split('\t')
+        if len(parts) == 3:
+            state, next_state, symbol = parts
+            fsa[(int(state), symbol)] = int(next_state)
+
+for line in sys.stdin:
+    input_string = line.strip()
+    if is_accepted(fsa, input_string):
+        print("YES")
+    else:
+        print("NO")

TaskB00/test1.in

@@ -0,0 +1,9 @@
+xxyz
+xyz
+xy
+zz
+xxy
+yzx
+
+x
+xyzz

TaskB01/description.txt

@@ -0,0 +1,10 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
+Create your own FSA description to check whether the string starts with "01" and ends with "01.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB01/fsa_description.arg

@@ -0,0 +1,12 @@
+0 1 0
+0 3 1
+3 3 0
+3 3 1
+1 3 0
+1 2 1
+2 4 1
+4 4 1
+4 5 0
+5 5 0
+2 5 0
+5 2 1

TaskB01/run.py

@@ -0,0 +1,27 @@
+import sys
+
+def is_accepted(fsa, input_string):
+    current_state = 0
+    for symbol in input_string:
+        if (current_state, symbol) in fsa:
+            current_state = fsa[(current_state, symbol)]
+        else:
+            return False
+    return current_state == 2
+
+fsa_file = sys.argv[1]
+fsa = {}
+with open(fsa_file, 'r') as f:
+    for line in f:
+        parts = line.strip().split(' ')
+        if len(parts) == 3:
+            state, next_state, symbol = parts
+            fsa[(int(state), symbol)] = int(next_state)
+
+
+for line in sys.stdin:
+    input_string = line.strip()
+    if is_accepted(fsa, input_string):
+        print("YES")
+    else:
+        print("NO")

TaskB01/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB02/description.txt

@@ -0,0 +1,9 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
+Create your own FSA description to check whether the string starts with "10" and ends with "10.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.

TaskB02/test.exp

@@ -0,0 +1,14 @@
+NO
+YES
+NO
+YES
+NO
+YES
+YES
+NO
+NO
+NO
+NO
+NO
+NO
+NO

TaskB02/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB03/description.txt

@@ -0,0 +1,11 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
+Create your own FSA description to check whether the string contains "0"
+even number of times.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB03/test.exp

@@ -0,0 +1,14 @@
+NO
+NO
+YES
+YES
+YES
+NO
+YES
+NO
+YES
+NO
+YES
+YES
+NO
+YES

TaskB03/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB04/description.txt

@@ -0,0 +1,11 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
+Create your own FSA description to check whether the string contains "0"
+odd number of times.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB04/test.exp

@@ -0,0 +1,14 @@
+YES
+YES
+NO
+NO
+NO
+YES
+NO
+YES
+NO
+YES
+NO
+NO
+YES
+NO

TaskB04/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB05/description.txt

@@ -0,0 +1,10 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskB00.
+Create your own FSA description to check whether the line contains string '19DD', where D is a digit.
+Save it to fsa_description.arg file.
+
+FSA alphabet is '0123456789x'.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB05/simple.exp

@@ -0,0 +1,6 @@
+NO
+YES
+NO
+NO
+YES
+YES

TaskB05/simple.in

@@ -0,0 +1,6 @@
+3214545443
+1910
+19
+xxx2190x
+xxx21905x
+1905x54545

TaskB06/description.txt

@@ -0,0 +1,9 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "hamlet" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.

TaskB06/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB06/simple.in

@@ -0,0 +1,3 @@
+haml
+hamlet
+aaahamletbbb

TaskB07/description.txt

@@ -0,0 +1,10 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "ophelia" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB07/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB07/simple.in

@@ -0,0 +1,3 @@
+oph
+ophelia
+xfdfdopheliafff

TaskB08/description.txt

@@ -0,0 +1,10 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "juliet" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB08/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB08/simple.in

@@ -0,0 +1,3 @@
+juli
+juliet
+dgfdgjulietaaa

TaskB09/description.txt

@@ -0,0 +1,10 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "macbeth" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+

TaskB09/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB09/simple.in

@@ -0,0 +1,3 @@
+macb
+macbeth
+xadadamacbethrff