All Questions
2 questions
2
votes
1
answer
124
views
Proof of dynamic programming calculation of Levenshtein distance
Let s1 and s2 are 2 arbitrary strings with lengths l1 and ...
- 203
2
votes
1
answer
197
views
Varieties of rational languages and (pseudo-)varieties of finite monoids, question regarding closure property
Let $\mathcal Rat(A)$ denote the class of rational (or regular) languages over the alphabet $A$, a subset $\mathcal V(A) \subseteq \mathcal Rat(A)$ is called a variety of (rational) languages iff
...
- 798