
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

32,103 Listeners

30,680 Listeners

288 Listeners

1,094 Listeners

624 Listeners

583 Listeners

299 Listeners

344 Listeners

209 Listeners

201 Listeners

318 Listeners

98 Listeners

576 Listeners

100 Listeners

228 Listeners