
Sign up to save your podcasts
Or


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.
Read more
By Kyle Polich4.4
475475 ratings
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.
Read more

290 Listeners

622 Listeners

584 Listeners

302 Listeners

332 Listeners

228 Listeners

206 Listeners

203 Listeners

306 Listeners

96 Listeners

517 Listeners

261 Listeners

131 Listeners

228 Listeners

620 Listeners