Deterministic Finite Automata (DFA) Examples: Sigma*, Empty Set, and More

Publicado el: 01 enero 1970
en el canal de: Easy Theory

11,301

255

Here we try to make sense out of various languages, and more importantly, DFAs. The languages we look at, and make DFAs for, are:
1. Sigma*
2. {epsilon}
3. empty set
4. Sigma* \ {epsilon}
5. (empty set)*
6. {epsilon}*

Recall that a DFA is a 5-tuple (Q, Sigma, delta, q0, F) where Q is the set of states, Sigma is the alphabet, delta is the transition function, q0 is the start state, and F is the set of final state. A computation on a string is the sequence of states that are visited, starting from the start state, on that string. A string is accepted if and only if the computation ends in a final state. In the video, a final state is one with a double circle.

PDF of DFA: https://drive.google.com/open?id=1JHG...
Solutions: https://drive.google.com/open?id=1Kto...

If you like this content, please consider subscribing to my channel: / @easytheory

▶ADDITIONAL QUESTIONS◀
1. Are these the smallest DFAs for these languages?
2. Is there a set S, not equal to Sigma, where S* = Sigma*?
3. Can we have two DFAs with a different number of states with the same language?

▶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.

En esta página del sitio puede ver el video en línea Deterministic Finite Automata (DFA) Examples: Sigma*, Empty Set, and More de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 01 enero 1970, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 11,301 veces y le gustó 255 a los espectadores. Disfruta viendo!

24,451

371