updated: 2022-01-23_12:32:30-05:00

RL Closure under Concatenation

• if A and B are the two regular languages over $\Sigma$ then the concatenation of A and B
• $AB={xy\in\Sigma^\star |x\in A$ and $y\in B$
• 

NFA Example

• Where it gets interesting... Nondeterministic Finite Automata

• Accept state of $M_1$ becomes the start state of $M_2$