Mursalin HabiB
Mr. Habib completed his undergraduate studies in 2021 from the department of CSE at Bangladesh University of Engineering and Technology (BUET). Since then, he has been a lecturer here at BRAC University.
This course introduces you to the world of automata and computability theory. The central question computability theory attempts to answer is: "What can and can not be computed?" Of course, to answer such a question, we need to first formalize what it means to compute. This course shows you how to do this and more! We will see different models of computation: regular expressions, finite automata, context free grammars, and pushdown automata.
Mr. Habib completed his undergraduate studies in 2021 from the department of CSE at Bangladesh University of Engineering and Technology (BUET). Since then, he has been a lecturer here at BRAC University.
Ms. Rashid completed her B.Sc from Department of CSE, BRAC University and was selected as the Valedictorian of BRACU. She has been working as a Lecturer in the same department. She has expertise in several fields whether it's academic or non-academic.
This might happen due to late advising or maybe your GSuite email address is not available to the course coordinator. Please contact the coordinator or your theory faculty from your GSuite Email to get an invitation as soon as possible.
The Open edX platform works best with current versions of Chrome, Edge, Firefox, Internet Explorer, or Safari.
See our list of supported browsers for the most up-to-date information.
There is no mandatory tool required.
None! You should focus on understanding the concepts well. We will provide you with a lot of resources and assistance.