What is an Nondeterministic Finite Automaton (NFA)?
5.3 هزار بار بازدید -
4 سال پیش
-
Here we ponder the question
Here we ponder the question about what is "necessary" for a state-based machine to recognize the concatenation of two regular languages (or the star of one). We realize that we only need "epsilon" transitions to be able to "instantaneously" jump from one state to another, as well as allow for "nondeterminism". We call these NFAs (nondeterministic finite automata), and we show that we can achieve concatenation and star really easily with them (and even union!). The problem is that they are not the same thing as DFAs, and in a future lecture we will show equivalence.
If you like this content, please consider subscribing to my channel: @easytheory
▶ADDITIONAL QUESTIONS◀
1. Can you make an NFA for all strings that contain 011 as a substring? How many states are needed?
2. How small can an NFA be comparatively to a DFA for the same language? (Try working out small examples).
▶SEND ME THEORY QUESTIONS◀
[email protected]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory.
If you like this content, please consider subscribing to my channel: @easytheory
▶ADDITIONAL QUESTIONS◀
1. Can you make an NFA for all strings that contain 011 as a substring? How many states are needed?
2. How small can an NFA be comparatively to a DFA for the same language? (Try working out small examples).
▶SEND ME THEORY QUESTIONS◀
[email protected]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory.
4 سال پیش
در تاریخ 1399/03/15 منتشر شده
است.
5,314
بـار بازدید شده