(Homo)Morphisms vs. Substitutions and Regular Language Closure Properties
Автор: Easy Theory
Загружено: 2020-11-04
Просмотров: 1502
Описание:
Here we introduce morphisms (also called homomorphisms) and substitutions, and briefly show that regular languages are closed under both operations. The general principle is that morphisms map strings to strings, and substitutions map strings to languages; otherwise, they behave very similarly. We can assume that each maps a single character (or epsilon) to a string (for morphisms) or language (for substitutions).
Easy Theory Website: https://www.easytheory.org
Discord: / discord
If you like this content, please consider subscribing to my channel: / @easytheory
▶SEND ME THEORY QUESTIONS◀
[email protected]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
