Automata and Computability
Completed by Mohammad Ashik Shaik
October 10, 2026
63 hours (approximately)
Mohammad Ashik Shaik's account is verified. Coursera certifies their successful completion of Automata and Computability
What you will learn
Master finite automata, pushdown automata, and Turing machines to analyse computation limits and formal language processing.
Understand computability, NP-completeness, and complexity classes to assess problem-solving limits in theoretical computer science.
Apply proof techniques and logic to formalise computational models, algorithmic efficiency, and automata-based problem-solving.
Construct regular expressions and context-free grammars to solve pattern matching and parsing problems in software engineering.
Skills you will gain
- Category: Mathematical Theory & Analysis
- Category: Deductive Reasoning
- Category: Graph Theory
- Category: Algorithms
- Category: Theoretical Computer Science
- Category: Computer Science
- Category: Logical Reasoning
- Category: Formal Learning
- Category: Computational Thinking
- Category: Computational Logic
