|
Dominique Perrin
Dominique Pierre Perrin (b. 1946) is a French mathematician and Theoretical computer science, theoretical computer scientist known for his contributions to coding theory and to combinatorics on words. He is a professor of the University of Marne-la-Vallée and currently serves as the President of ESIEE Paris. Biography Perrin earned his PhD from Paris Diderot University, Paris 7 University in 1975. In his early career, he was a CNRS researcher (1970–1977) and taught at the University of Chile (1972–1973). Later, he worked as a professor at the University of Rouen (1977–1983), Paris Diderot University, Paris 7 University (1983–1993), and École Polytechnique (1982–2002). Since 1993, Perrin is a professor at the University of Marne-la-Vallée, and since 2004, he is the President of ESIEE Paris. Perrin is a member of Academia Europaea since 1989. Scientific contributions Perrin has been a member of the M. Lothaire, Lothaire group of mathematicians that developed the found ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Language Theory
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules. The alphabet of a formal language consists of symbols, letters, or tokens that concatenate into strings of the language. Each string concatenated from symbols of this alphabet is called a word, and the words that belong to a particular formal language are sometimes called ''well-formed words'' or ''well-formed formulas''. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar, which consists of its formation rules. In computer science, formal languages are used among others as the basis for defining the grammar of programming languages and formalized versions of subsets of natural languages in which the words of the language represent concepts that are associated with particular meanings or semantics. In computational complexity t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
