This course teaches how to convert a Non-deterministic Finite Automaton (NEA) to a regular expression using Arden's Lemma. The goal is to understand the process of transforming NEAs into regular expressions. The course covers the application of Arden's Lemma in converting NEAs to regular expressions through examples. The teaching method involves theoretical explanations and practical examples. This course is intended for individuals interested in automata theory, formal languages, and regular expressions.
Overview
Syllabus
NEA zu regulärer Ausdruck mit Ardens Lemma
Lemma von Arden
NEA zu RegEx mit Ardens Lemma (Beispiel)
Taught by
@NLogSpace
