Automata, Languages and Compatibility
- Instructor(s): Mock
- Institution: University of Alaska (Anchorage)
- Category: Computer Science
- Description: Study of the theory of computing. Topics include context-free grammars and parsing; finite automata and regular languages; pushdown automata and context-free grammars, deterministic and nondeterministic Turing machines; decidability and computability; complexity classes and complete problems.
Facebook
Twitter
LinkedIn
Email Newsletter
SFI News Feed
Google+
YouTube
iTunes U