vault backup: 2025-04-14 19:58:43

Languages & Machines/Regular languages.md

@@ -34,3 +34,15 @@ $|w| = 0$, then, trivially, $w = \epsilon \therefore w^R = \epsilon$
 
 **I.S.:**
 $|w| = n \geq 1$, so $w = u a$ with $|u| = n-1$,
+
+
+## Operations on strings
+- Concatenation (associative)
+- Substring, prefix, suffix
+- Replication (exponentiation): a string concatenated with itself
+- Reversal ($u^R$)
+
+## Operations on languages
+- Lifting operations on strings to languages
+- Concatenation of languages
+- Kleene star -