NFAs are a type of finite-state machine that do not need to obey certain restrictions, and can be converted into an equivalent DFA. They are used in the implementation of regular expressions and recognize only regular languages. NFAs have been generalized in multiple ways.
University of Washington
Autumn 2021
CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.
No concepts data
+ 33 more concepts