Problems and Languages: Regular Languages

Related lectures (30)

Page 1 of 3

Introduces regular expressions, covering language sets, syntax, semantics, and limitations.

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Explores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.

Covers formal languages, operations like union and concatenation, and the Kleene star operation.

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.

Covers the computation of 'nullable' and 'first' for regular expressions.

Covers the fundamentals of finite automata and formal languages.

Explores Turing machines, recursive languages, undecidability, and symbol elimination.

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.