uni_notes/10 Courses/02 - SoSe 2026/AT/29593952 - Regular Languages.md

created, course, topic, related, type, status, tags

created	course	topic	related	type	status	tags
2026-04-08 10:32	29593850 - Automationtheory	languages	29593940 - Formal Languages	lecture	🟢	university

📌 Summary

[!abstract]

---

📝 Content

A language L that can be described by a 29593975 - Regular Expressions r (i. e. L(r) = L) is called regular.

Warning

There a several important languages that cannot be described by a regular expression. (proof later)