CmpE 350 Formal Languages and Automata Theory

Catalog Description: 

Strings and languages. Classification of grammars. Finite-state automata and regular expressions. Pushdown automata and context-free grammars. Context sensitive grammars and linear bounded automata. Turing machines.

Credits: 

(3+0+0) 3 ECTS 5

Prerequisites: 

CmpE 220
Year Semester Course Page Instructor Course Schedule Lab Schedule
2020 Spring A. C. Cem Say
2019 Fall A. C. Cem Say WThTh 434 BM A2 | BM A3 | BM A3
2019 Spring A. C. Cem Say WThTh 323 BM A2
2019 Summer Özlem Salehi Köken WWWThThTh 567567
2018 Fall A. C. Cem Say ThFF BM A2 | BM A2 | BM A2
2018 Spring A. C. Cem Say WFF 334 BM A2 | BM A2 | BM A2
2018 Summer A. C. Cem Say TTThThFF 787878
2017 Spring A. C. Cem Say MFF 323
2016 Spring A. C. Cem Say WFF 334 BM A2
2015 Spring A. C. Cem Say WFF334 ETA A2, ETA A2, ETA A2
2014 Spring Course Page A. C. Cem Say
2014 Summer A. C. Cem Say TTWWFF 676767 ETA A2
2013 Spring Course Page A. C. Cem Say
2012 Spring Course Page A. C. Cem Say
2011 Spring Course Page A. C. Cem Say
2010 Spring Course Page A. C. Cem Say
2010 Summer Course Page A. C. Cem Say

Contact us

Department of Computer Engineering, Boğaziçi University,
34342 Bebek, Istanbul, Turkey

  • Phone: +90 212 359 45 23/24
  • Fax: +90 212 2872461
 

Connect with us

We're on Social Networks. Follow us & get in touch.