Edodovivmagarwal
Computer Science - Graduate CS - Theory of computation - Computability and Complexity
Log in

Preparing your experience...

Loading scripts and resources

Comments (0)

0/5000

Comments are reviewed before appearing publicly.

About this Experience

Computer Science - Graduate CS - Theory of computation - Computability and Complexity

vivmagarwal
vivmagarwalJan 29, 2026

Description

4 sections. Section 1 'Automata Theory': Finite Automata (DFA/NFA): recognize regular languages (email validation, simple patterns). Pushdown Automata: recognize context-free languages (matching parentheses, programming syntax). Turing Machine: recognizes recursively enumerable languages (anything c

Details

Computer ScienceGraduate CS

Engagement

5

Likes

0

Remixes

0

Comments

Browse all experiences