HackerTube 中文?

1. Introduction, Finite Automata, Regular Expressions

MIT OpenCourseWareYouTube ↗

Further reading 1

When does input become an instruction? →A typo can still be valid code. A data format can turn out to express computation. Follow an input inward and identify who decides how to interpret it.This video helps answer · What gives a string of symbols its meaning?

Caption notes

A finite automaton remembers an input prefix through its current state. The course’s regular expressions use union, concatenation and star, yet describe the same class of languages.

Video or transcript source ↗
Original passages · 2
representing a computer that has a very small amount of memory
1. Introduction, Finite Automata, Regular Expressions · ▶ 10:15–10:20
They are equivalent in power with respect to the class of languages they describe.
1. Introduction, Finite Automata, Regular Expressions · ▶ 42:16–42:23

Hacker News comments

View original on HN ↗