
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,220 Listeners

30,643 Listeners

288 Listeners

1,109 Listeners

630 Listeners

583 Listeners

308 Listeners

345 Listeners

207 Listeners

203 Listeners

313 Listeners

100 Listeners

552 Listeners

103 Listeners

229 Listeners