Hesaplama Teorisi - The Theory of Computation

Bu yıl İstanbul Ticaret Üniversitesinde Doktoraya başladım.

İlk derslerimden biri, Hesaplama Teorisi.

Bunlar da araştırırken bulduğum kaynaklar:
http://www.aduni.org/courses/theory/index.php?view=cw
http://ceng2.ktu.edu.tr/~cakir/otomata.html
http://bmb.cu.edu.tr/uorhan/Automata.htm
https://www.vizefinalsorupaylasimi.com/2303-bicimsel-diller-ve-otomata-teorisi-ders-1.html

Dersin temel kaynak kitabı: 
Introduction to the Theory of Computation 3rd Edition

Bu arada benim sunum konum: 
Church-Turing tezi (The Church-Turing Thesis)

Diğer kaynaklar:

http://w3.gazi.edu.tr/~akcayol/BM305.htm

http://bilgisayarkavramlari.sadievrenseker.com/2008/11/11/belirsiz-sonlu-otomat-nondeterministic-finite-automat-nfa/

https://www.facebook.com/vizefinalsorupaylasimi/posts/1620604264820718

https://www.vizefinalsorupaylasimi.com/2307-dfa-belirli-sonlu-otomat-ders-4.html

https://kilinjos.files.wordpress.com/2010/07/sorular1.pdf

http://ibrahimaksoy.org/otomata-ders-notlari/

https://www.youtube.com/watch?v=Or7iJVKfeC8&list=PLLkveIkyQHpFOb_FrXjbuLUClE01l-P1k

https://www.youtube.com/watch?v=F-EXmG1-gRQ&list=PLbtzT1TYeoMjNOGEiaRmm_vMIwUAidnQz&index=3#t=21.62525

https://www.vizefinalsorupaylasimi.com/2411-bicimsel-diller-ve-otomata-teorisi-soru-cozumu-11.html

Vizeye hazırlık:

http://slideplayer.biz.tr/slide/9990683/ 
https://kilinjos.files.wordpress.com/2010/07/sorular1.pdf
https://www.vizefinalsorupaylasimi.com/2308-nfa-belirsiz-sonlu-otomat-ders-5.html
https://www.vizefinalsorupaylasimi.com/2311-nfayi-dfaya-cevirme-ders-7.html
https://www.youtube.com/watch?v=ASNuZuKauzY
https://www.youtube.com/watch?v=w6nzGoaQjmM
https://www.youtube.com/watch?v=246xRSk4YAk
https://www.youtube.com/watch?v=1EspPQmr_C4
http://www.sercanuzumcu.com/ders-notlari/yazilim-muhendisligi-4-sinif/bicimsel-diller-ve-automata-teorisi/
http://www.cs.odu.edu/~toida/nerzic/390teched/regular/fa/nfa-2-dfa.html
https://www.youtube.com/watch?v=MMfLTfoJUAI
http://condor.depaul.edu/glancast/444class/docs/nfa2dfa.html
http://er.yuvayana.org/nfa-to-dfa-conversion-algorithm-with-solved-example/
http://web.cecs.pdx.edu/~harry/compilers/slides/LexicalPart3.pdf
https://www.tutorialspoint.com/automata_theory/ndfa_to_dfa_conversion.htm
http://fleder44.net/312/notes/26_converting_nfa/index.html
http://www.win.tue.nl/mdseminar/pres/ploeger-19-10-06.pdf
http://ggnindia.dronacharya.info/csedept/Downloads%5CQuestionBank%5Cmtech%5CISem/lecture5-NDFA%20to%20DFA%20conversion.pdf
http://www.personal.kent.edu/~rmuhamma/Compilers/MyCompiler/NFAtoDFA.htm
https://www.itu.dk/courses/BPRD/E2012/regex-to-nfa.pdf
http://zeynepaltan.info/HesaplamaTeorisi.html
https://www.youtube.com/watch?v=CJe9V0WQJSI
http://home.wlu.edu/~levys/courses/cs332w2004/lectures/26_JAN_2004.pdf
http://www.cs.dartmouth.edu/~mckeeman/cs48/mxcom/doc/RegularExpressionGrammar.pdf
http://cs.stackexchange.com/questions/9602/cfg-with-regular-expression-terminals-on-rhs
http://cs.stackexchange.com/questions/9050/regular-expression-to-context-free-grammar
http://web.stanford.edu/class/archive/cs/cs103/cs103.1142/lectures/17/Small17.pdf