Concept

Probabilistic automaton

Related lectures (5)

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

Explores the project structure for solving WS1S formulas and planned additions.

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

Explores countable and uncountable sets, demonstrating how to determine the cardinality of different sets through listing elements in a sequence.

Explores cardinality, countable sets, and examples of countable and uncountable sets.