Recent questions tagged regular-language

3 3 votes
1 answers 1 answer
1.2k
1.2k views
Let $L$ be a regular language and $w$ be a string in $L$. If $w$ can be split into $x, y$ and $z$ such that $|xy| \leq$ number of states in the minimal DFA for $L$, and $...