Return to Video

01-46 Fsm Interpretation

  • 0:00 - 0:04
    So now let's really prove the power of our finite state machine interpreter
  • 0:04 - 0:07
    by showing that we could figure out any finite state machine.
  • 0:07 - 0:13
    You should submit, via the interpreter, values for edges and accepting those 2 key variables
  • 0:13 - 0:17
    that encode the regular expression "q*"--
  • 0:17 - 0:22
    so the empty string, "q", "qq".
  • 0:22 -
    For convenience, name your start state 1.
Title:
01-46 Fsm Interpretation
Description:

more » « less
Video Language:
English
Team:
Udacity
Project:
CS262 - Programming Languages
Duration:
0:26
Amara Bot added a translation

English subtitles

Revisions