About this document
FSA in Compiler Design Overview by Yujia Tian is a document available to read on EtoBox.
The document discusses regular expressions and finite state automata, including how regular expressions are used to define languages and can be represented as finite state automata. It covers different types of finite state automata like deterministic and non-deterministic models, and how a deterministic finite automata uses a transition table to implement a regular expression matching algorithm.
- Author
- Yujia Tian
- Language
- EN