<- previous index next ->
This course covers some of the fundamental beginnings and
foundations of computers and software. From automata to
Turing Machines and formal languages to our programming
languages, an interesting progression.
A fast summary of what will be covered in this course (part 1)
For reference, skim through the
automata definitions and
language definitions and
grammar definitions
to get the terms that will be used in this course.
Don't panic, this will be easy once it is explained.
Syllabus provides topics, homework and exams.
HW1 is assigned
Oh! "Formal Language" vs "Natural Language"
Boy hit ball.
word word word punctuation tokens
noun verb noun period parsed
subject predicate object sentence semantic
"Language" all legal sentences
In this class language will be a set of strings from a
given alphabet. All math operations on sets apply,
examples: union, concatenation, intersection, cross product, etc.
We will cover grammars that define languages.
We will define machines called automata that accept languages.
<- previous index next ->