README.md

@@ -1,11 +1,6 @@
 
 ## Zajęcia 1
 
-Copyright AMU Poznan
-
-Made by multiple people 
-
-
 ### Informacje na temat przedmiotu
 
 Prowadzący: Jacek Kałużny
@@ -23,3 +18,347 @@ W ten sposób będziemy aktualizować zadania co zajęcia.
 Zadania robimy do końca soboty poprzedzającej zajęcia
 
 Rozwiązanie zapisujemy w pliku run.py
+
+
+## Zajęcia 2 Wyrażenia regularne
+
+Dokumentacja wyrażeń regularnych w python3: https://docs.python.org/3/library/re.html
+
+### Podstawowe funkcje
+
+search - zwraca pierwsze dopasowanie w napisie
+
+findall - zwraca listę wszystkich dopasowań (nienakładających się na siebie)
+
+match - zwraca dopasowanie od początku string
+
+To tylko podstawowe funkcje, z których będziemy korzystać. W dokumentacji opisane są wszystkie.
+
+### Obiekt match
+
+```
+import re
+answer = re.search('na','banan')
+print(answer)
+print(answer.start())
+print(answer.end())
+print(answer.group())
+
+answer = re.search('na','kabanos')
+print(answer)
+type(answer)
+
+if answer:
+    print(answer.group())
+else:
+    pass
+```
+
+### Metaznaki
+
+ 
+- [] -  zbiór znaków
+- . - jakikolwiek znak
+
+- ^ - początek napisu
+- $ - koniec napisu
+
+- ? - znak występuje lub nie występuje
+- \* - zero albo więcej pojawień się
+- \+ - jeden albo więcej pojawień się
+- {} - dokładnie tyle pojawień się
+
+- | - lub
+- () - grupa
+- \ -znak ucieczki
+
+- \d digit
+- \D nie digit
+- \s whitespace
+- \S niewhitespace
+
+
+### Flagi
+
+Można użyć specjalnych flag, np: 
+`re.search('ma', 'AlA Ma KoTa', re.IGNORECASE)`.
+
+### Przykłady (objaśnienia na laboratoriach)
+
+Do nauki lepiej użyć pythona w wersji interaktywnej, a najlepiej ipython.
+
+```
+import re
+
+text = 'Ala ma kota i hamak, oraz 150 bananów.'
+
+re.search('ma',text)
+re.match('ma',text)
+re.match('Ala ma',text)
+re.findall('ma',text)
+
+re.findall('[mn]a',text)
+re.findall('[0-9]',text)
+re.findall('[0-9abc]',text)
+re.findall('[a-z][a-z]ma[a-z]',text)
+re.findall('[a-zA-Z][a-zA-Z]ma[a-zA-z0-9]',text)
+re.findall('\d',text)
+
+re.search('[0-9][0-9][0-9]',text)
+re.search('[\d][\d][\d]',text)
+
+re.search('\d{2}',text)
+re.search('\d{3}',text)
+
+re.search('\d+',text)
+
+re.search('\d+ bananów',text)
+re.search('\d* bananów','Ala ma dużo bananów')
+re.search('\d* bananów',text)
+re.search('ma \d? bananów','Ala ma 5 bananów')
+re.search('ma ?\d? bananów','Ala ma bananów')
+re.search('ma( \d)? bananów','Ala ma bananów') 
+
+re.search('\d+ bananów','Ala ma 10 bananów albo 20 bananów')
+re.search('\d+ bananów$','Ala ma 10 bananów albo 20 bananów')
+
+text = 'Ala ma kota i hamak, oraz 150	bananów.'
+
+re.search('\d+ bananów',text)
+
+re.search('\d+\sbananów',text)
+
+re.search('kota . hamak',text)
+
+re.search('kota . hamak','Ala ma kota z hamakiem')
+
+re.search('kota .* hamak','Ala ma kota lub hamak')
+
+re.search('\.',text)
+
+re.search('kota|psa','Ala ma kota lub hamak')
+
+re.findall('kota|psa','Ala ma kota lub psa')
+
+re.search('kota (i|lub) psa','Ala ma kota lub psa')
+
+re.search('mam (kota).*(kota|psa)','Ja mam kota. Ala ma psa.').group(0)
+
+re.search('mam (kota).*(kota|psa)','Ja mam kota. Ala ma psa.').group(1)
+
+re.search('mam (kota).*(kota|psa)','Ja mam kota. Ala ma psa.').group(2)
+```
+
+
+
+
+
+
+
+### Przykłady wyrażenia regularne 2 (objaśnienia na laboratoriach)
+
+####  ^
+```
+re.search('[0-9]+', '123-456-789')
+re.search('[^0-9][0-9]+[^0-9]', '123-456-789')
+```
+
+#### cudzysłów
+'' oraz "" - oznaczają to samo w pythonie
+
+' ala ma psa o imieniu "Burek"'
+
+" ala ma psa o imieniu 'Burek' "
+
+' ala ma psa o imieniu \'Burek\' '
+
+" ala ma psa o imieniu \"Burek\" "
+
+#### multiline string
+
+#### raw string
+
+przy raw string znaki \ traktowane są jako zwykłe znaki \
+
+chociaż nawet w raw string nadal są escapowane (ale wtedy \ pozostają również w stringu bez zmian)
+
+https://docs.python.org/3/reference/lexical_analysis.html
+
+dobra praktyka - wszędzie escapować
+
+```
+'\\'
+print('\\')
+
+r'\\'
+print(r'\\')
+
+
+print("abcd")
+print("ab\cd")
+print(r"ab\cd")
+
+print("ab\nd")
+print(r"ab\nd")
+
+
+print("\"")
+print(r"\"")
+
+print("\")
+print(r"\")
+
+re.search('\\', r'a\bc')
+re.search(r'\\', r'a\bc')
+re.search('\\\\', r'a\bc')
+```
+
+#### RE SUB
+```
+re.sub(pattern, replacement, string)
+
+re.sub('a','b', 'ala ma kota')
+```
+
+#### backreferencje:
+
+```
+
+re.search(r' \d+ \d+', 'ala ma 41 41 kota')
+re.search(r' \d+ \d+', 'ala ma 41 123 kota')
+re.search(r' (\d+) \1', 'ala ma 41 41 kota')
+re.search(r' (\d+) \1', 'ala ma 41 123 kota')
+```
+
+#### lookahead ( to sa takie assercje):
+```
+re.search(r'ma kot', 'ala ma kot')
+re.search(r'ma kot(?=[ay])', 'ala ma kot')
+re.search(r'ma kot(?=[ay])', 'ala ma kotka')
+re.search(r'ma kot(?=[ay])', 'ala ma koty')
+re.search(r'ma kot(?=[ay])', 'ala ma kota')
+
+re.search(r'ma kot(?![ay])', 'ala ma kot')
+re.search(r'ma kot(?![ay])', 'ala ma kotka')
+re.search(r'ma kot(?![ay])', 'ala ma koty')
+re.search(r'ma kot(?![ay])', 'ala ma kota')
+```
+
+#### named groups
+```
+r = re.search(r'ma (?P<ilepsow>\d+) kotow i (?P<ilekotow>\d+) psow', 'ala ma 100 kotow i 200 psow')
+r.groups()
+r.groups('ilepsow')
+r.groups('ilekotow')
+```
+
+#### re.split
+```
+('a,b.c,d').split(',')
+('a,b.c,d').split(',')
+('a,b.c,d').split(',.')
+re.split(r',', 'a,b.c,d') 
+re.split(r'[.,]', 'a,b.c,d') 
+```
+#### \w word character
+```
+\w - matchuje Unicod word character , jeżeli flaga ASCII to [a-zA-Z0-9_]
+\w - odwrotne do \W, jezeli flaga ASCI to [^a-zA-Z0-9_]
+
+re.findall(r'\w+', 'ala ma 3 koty.')
+re.findall(r'\W+', 'ala ma 3 koty.')
+```
+#### początek albo koniec słowa | word boundary
+```
+re.search(r'\bkot\b', 'Ala ma kota')
+re.search(r'\bkot\b', 'Ala ma kot')
+re.search(r'\bkot\b', 'Ala ma kot.')
+re.search(r'\bkot\b', 'Ala ma kot ')
+
+re.search(r'\Bot\B', 'Ala ma kot ')
+re.search(r'\Bot\B', 'Ala ma kota ')
+```
+#### MULTILINE
+```
+re.findall(r'^Ma', 'Ma kota Ala\nMa psa Jacek') 
+re.findall(r'^Ma', 'Ma kota Ala\nMa psa Jacek', re.MULTILINE)
+```
+#### RE.COMPILE
+
+
+
+
+## zajęcia 6
+
+instalacja https://pypi.org/project/google-re2/
+
+### DFA i NDFA
+
+```
+import re2 as re
+n = 50
+regexp =  "a?"*n+"a"*n
+s = "a"*n
+re.match(regexp, s)
+```
+
+```
+re.match(r"(\d)abc\1", "3abc3") # re2 nie obsługuje backreferencji
+```
+
+
+re2 max memory - podniesienie limitu
+time # mierzenie czasu działania
+
+
+gdyby ktoś chciał poczytać więcej:
+https://swtch.com/~rsc/regexp/regexp1.html
+
+### UTF-8
+```
+c = "ℋ"
+ord(c)
+chr(8459)
+8* 16**2 + 0 * 16**(1) + 0*16**(0)
+15*16**3 + 15* 16**2 + 15 * 16**(1) + 15*16**(0)
+```
+
+```
+xxd -b file
+xxd  file
+```
+
+termin oddawania zadań - 15. listopada
+
+
+## Zajęcia 7
+https://www.openfst.org/twiki/bin/view/GRM/Thrax
+
+https://www.cs.jhu.edu/~jason/465/hw-ofst/hw-ofst.pdf
+
+Wszystkie zadania proszę robić na wzór `TaskH00`. Proszę umieszczać gramatykę w pliku `grammar.grm` oraz
+opisywać finalną regułę nazwą `FinalRule`.
+
+
+
+## KOLOKWIUM
+Operatory, obowiązujące na kolokwium
+====================================
+
+* kwantyfikatory `-` `*` `+` `?` `{n}` `{n,}` `{n, m}`
+* alternatywa — `|`
+* klasy znaków — `[...]`
+* zanegowane klasy znaków — `[^...]`
+* dowolny znak — `.`
+* unieważnianie znaków specjalnych — \
+* operatory zakotwiczające — `^` `$`
+
+
+Na kolokwium do każdego z 4 pytań będą 3 podpunkty. Na każdy podpunkt odpowiadamy TAK/NIE. Czas trwania to 15 minut.
+
+- zawsze daszek i dolar
+- nie bierzemy pod uwagę capturing (jeżeli są pytania o równoważne)
+- proponuję wydrukować cały test w wersji bez opdowiedzi i sprawdzać
+
+
+Do zaliczenia należy zdobyć conajmniej 10 punktów.

TaskC00/description.txt

@@ -1,12 +0,0 @@
-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.
-

TaskC00/long.exp

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

TaskC00/long.in

@@ -1,7 +0,0 @@
-aaa
-aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-aaaa
-aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-xyz
-aba
-a

TaskC00/test1.arg

@@ -1,16 +0,0 @@
-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

TaskC00/test1.exp

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

TaskC00/test1.in

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

TaskC00/testnfa.arg

@@ -1,7 +0,0 @@
-0	1	a
-1	0	a
-1	2	b
-2	4	c
-1	3	b
-3
-4

TaskC00/testnfa.exp

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

TaskC00/testnfa.in

@@ -1,8 +0,0 @@
-abc
-ab
-abcd
-aaaabc
-aaaaaaaabc
-aaaaaaabc
-zzz
-aaaaaaabc

TaskC01/description.txt

@@ -1,11 +0,0 @@
-Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
-Create your own non deterministic FSA description to check whether the string second letter
-from right is 'b'.
-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. 
-

TaskC01/test.exp

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

TaskC01/test.in

@@ -1,6 +0,0 @@
-abc
-abbc
-bca
-b
-abaa
-aaacbb

TaskC02/description.txt

@@ -1,11 +0,0 @@
-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. 
-

TaskC02/test.exp

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

TaskC02/test.in

@@ -1,6 +0,0 @@
-ab
-a
-abbab
-bbbbb
-ababaab
-b

TaskC03/description.txt

@@ -1,10 +0,0 @@
-Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
-Create your own non deterministic FSA description to check whether the string
-contains "abc"
-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. 

TaskC03/test.exp

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

TaskC03/test.in

@@ -1,7 +0,0 @@
-abc
-acabc
-acabccb
-abbab
-bbbbb
-ababaab
-bc

TaskC04/description.txt

@@ -1,22 +0,0 @@
-Deterministic automaton III
-===========================
-
-Read a description of a finite-state automaton in the AT&T format
-(without weights) from the file in the first argument. Then, read strings from the
-standard input. 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.
-
-If there is a non-determinism in the automaton, the first transition should be chosen.
-
-The automaton can contain epsilon transitions ("<eps>" instead of a
-character). They should be interpreted as follows: an epsilon
-transition can be used (without "eating" a character from the input),
-if there is no other transition applicable. You can assume that there
-is at most one epsilon transition from a given state and that there
-are no cycles with epsilon transition.
-
-Your program does not have to check whether the description is correct
-and whether the automaton is deterministic. You can assume that the
-automaton does not contain epsilon transitions.
-

TaskC04/eps.arg

@@ -1,8 +0,0 @@
-0	1	a
-1	0	a
-1	2	b
-2	4	c
-1	3	<eps>
-3	4	d
-3
-4

TaskC04/eps.exp

@@ -1,10 +0,0 @@
-TRUE a
-FALSE aa
-TRUE aaa
-TRUE abc
-TRUE aaabc
-FALSE aaabcd
-FALSE aabc
-FALSE abd
-TRUE ad
-FALSE aad

TaskC04/eps.in

@@ -1,10 +0,0 @@
-a
-aa
-aaa
-abc
-aaabc
-aaabcd
-aabc
-abd
-ad
-aad

TaskC04/long.exp

@@ -1,7 +0,0 @@
-FALSE aaa
-FALSE aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-TRUE aaaa
-TRUE aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-FALSE xyz
-FALSE aba
-FALSE a

TaskC04/long.in

@@ -1,7 +0,0 @@
-aaa
-aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-aaaa
-aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-xyz
-aba
-a

TaskC04/simple1.arg

@@ -1,5 +0,0 @@
-# prosty automat akceptujący tylko napis "abc"
-0	1	a
-1	2	b
-2	3	c
-3

TaskC04/simple1.exp

@@ -1,8 +0,0 @@
-FALSE a
-FALSE ab
-TRUE abc
-FALSE abcd
-FALSE aaaaab
-TRUE abc
-FALSE xyz
-FALSE 0

TaskC04/simple1.in

@@ -1,8 +0,0 @@
-a
-ab
-abc
-abcd
-aaaaab
-abc
-xyz
-0

TaskC04/simple2.arg

@@ -1,9 +0,0 @@
-# automat akceptujący napis "ab*c" (b powielony dowolną liczbę razy) i "kot"
-0	1	a
-1	1	b
-1	2	c
-0	3	k
-3	4	o
-4	5	t
-2
-5

TaskC04/simple2.exp

@@ -1,9 +0,0 @@
-TRUE kot
-TRUE ac
-TRUE abc
-TRUE abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbc
-FALSE abcd
-FALSE abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccc
-FALSE kotek
-FALSE kotabc
-TRUE kot

TaskC04/simple2.in

@@ -1,9 +0,0 @@
-kot
-ac
-abc
-abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbc
-abcd
-abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccc
-kotek
-kotabc
-kot

TaskC05/description.txt

@@ -1,49 +0,0 @@
-Dictionary
-==========
-
-Your program should read a finite-state automaton from file in the first argument.
-The automaton is deterministic, you can assume it does not contain
-cycles.
-
-Each automaton path is labeled with a symbol sequence of the following form:
-
-<input word>;<description>
-
-e.g.:
-
-biały;ADJ
-dom;N
-piła;N
-piła;V
-stali;N
-stali;V
-stali;ADJ
-
-Next you should read words from the standard input.
-For each word, you should all automaton
-paths that begin a given word, the following symbol is ';'
-(semicolon), e.g. for the word 'dom' we are looking for paths
-beginning with 'dom;'. If there is no such path, the following message
-should be printed:
-
-<input word>;OOV
-
-For instance, for the automaton given above and the input:
-
-budynek
-dom
-piła
-
-we should get:
-
-budynek;OOV
-dom;N
-piła;N
-piła;V
-
-If there is more than one path for a given word, they should be given in alphabetical order.
-
-The program does not have to check whether the automaton is correct
-and whether it is deterministic and does not contain cycles.
-
-

TaskC05/elem.arg

@@ -1,31 +0,0 @@
-0	1	b
-0	2	d
-0	3	p
-0	4	s
-1	5	i
-2	6	o
-3	7	i
-4	8	t
-5	9	a
-6	10	m
-7	11	ł
-8	12	a
-9	13	ł
-10	14	;
-11	15	a
-12	16	l
-13	17	y
-14	24	N
-15	18	;
-16	19	i
-17	20	;
-18	24	N
-18	24	V
-19	21	;
-20	22	A
-21	22	A
-21	24	N
-21	24	V
-22	23	D
-23	24	J
-24

TaskC05/elem.exp

@@ -1 +0,0 @@
-dom;N

TaskC05/elem.in

@@ -1 +0,0 @@
-dom

TaskC05/medium.exp

@@ -1,7 +0,0 @@
-arbuz;N
-arbuza;N
-arbuzowi;ADJ
-arbuzowi;N
-azylant;N
-azylanci;N
-azylantowie;OOV

TaskC05/medium.in

@@ -1,6 +0,0 @@
-arbuz
-arbuza
-arbuzowi
-azylant
-azylanci
-azylantowie

TaskC05/multi.arg

@@ -1,31 +0,0 @@
-0	1	b
-0	2	d
-0	3	p
-0	4	s
-1	5	i
-2	6	o
-3	7	i
-4	8	t
-5	9	a
-6	10	m
-7	11	ł
-8	12	a
-9	13	ł
-10	14	;
-11	15	a
-12	16	l
-13	17	y
-14	24	N
-15	18	;
-16	19	i
-17	20	;
-18	24	N
-18	24	V
-19	21	;
-20	22	A
-21	22	A
-21	24	N
-21	24	V
-22	23	D
-23	24	J
-24

TaskC05/multi.exp

@@ -1,2 +0,0 @@
-piła;N
-piła;V

TaskC05/multi.in

@@ -1 +0,0 @@
-piła

TaskC05/oov.arg

@@ -1,31 +0,0 @@
-0	1	b
-0	2	d
-0	3	p
-0	4	s
-1	5	i
-2	6	o
-3	7	i
-4	8	t
-5	9	a
-6	10	m
-7	11	ł
-8	12	a
-9	13	ł
-10	14	;
-11	15	a
-12	16	l
-13	17	y
-14	24	N
-15	18	;
-16	19	i
-17	20	;
-18	24	N
-18	24	V
-19	21	;
-20	22	A
-21	22	A
-21	24	N
-21	24	V
-22	23	D
-23	24	J
-24

TaskC05/oov.exp

@@ -1 +0,0 @@
-budynek;OOV

TaskC05/oov.in

@@ -1 +0,0 @@
-budynek

TaskC06/description.txt

@@ -1,21 +0,0 @@
-Paths
-======
-
-Your program should read a finite-state automaton from
-the standard input.
-The automaton is deterministic, you can assume it does not contain
-cycles. The automaton alphabet is the set of Polish lower-case letters
-(English letters plus: ą, ć, ę, ł, ń, ó, ś, ź and ż).
-
-Your program should print, on standard output, all the paths of the
-automaton in alphabetical order (to be precise: order induced by byte
-codes of strings, not according to the standard Polish order). "Print
-a path" means print a text line containing all subsequent characters.
-
-The program does not have to check whether the automaton is correct
-and whether it is deterministic and does not contain cycles.
-
-Weights (if any) should be disregarded.
-
-NOTE 1. You can add `LANG=C sort` to your Bash wrapper for the write sort.
-

TaskC06/medium2.exp

@@ -1 +0,0 @@
-a

TaskC06/small.exp

@@ -1,4 +0,0 @@
-biały
-dom
-piła
-stali

TaskC06/small.in

@@ -1,18 +0,0 @@
-0	1	b
-0	2	d
-0	3	p
-0	4	s
-1	5	i
-2	6	o
-3	7	i
-4	8	t
-5	9	a
-6	14	m
-7	10	ł
-8	11	a
-9	12	ł
-10	14	a
-11	13	l
-12	14	y
-13	14	i
-14

TaskC06/small2.exp

@@ -1,3 +0,0 @@
-biały
-piła
-stali

TaskC06/small2.in

@@ -1,18 +0,0 @@
-0	1	b
-0	2	d
-0	3	p
-0	4	s
-1	5	i
-2	6	o
-3	7	i
-4	8	t
-5	9	a
-6	15	m
-7	10	ł
-8	11	a
-9	12	ł
-10	14	a
-11	13	l
-12	14	y
-13	14	i
-14