Date: Fri, 06 Apr 2018 15:00:00 +0000
<p>In this episode, Kyle and Linhda discuss the theory of formal languages. Any language can (theoretically) be a formal language. The requirement is that the language can be rigorously described as a set of strings which are considered part of the language. Those strings are any combination of alphabet characters in the given language.</p> <p><a href="https://dataskeptic.com/blog/episodes/2018/the-theory-of-formal-languages"> Read more</a></p> <p> </p>
