|
Jean-Éric Pin
Jean-Éric Pin is a French mathematician and theoretical computer scientist known for his contributions to the algebraic automata theory and semigroup theory. He is a CNRS research director. Biography Pin earned his undergraduate degree from ENS Cachan in 1976 and his doctorate (Doctorat d'état) from the Pierre and Marie Curie University in 1981. Since 1988 he has been a CNRS research director at Paris Diderot University. In the years 1992–2006 he was a professor at École Polytechnique. Pin is a member of the Academia Europaea (2011) and an EATCS fellow (2014). In 2018, Pin became the first recipient of the Salomaa Prize in Automata Theory, Formal Languages, and Related Topics. Notable Work Pin is the author of the prominent textbook ''Varieties of Formal Languages'' on automata theory and formal language theory In logic, mathematics, computer science, and linguistics, a formal language is a set of string (computer science), strings whose symbols are taken from a s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Language Theory
In logic, mathematics, computer science, and linguistics, a formal language is a set of string (computer science), strings whose symbols are taken from a set called "#Definition, alphabet". The alphabet of a formal language consists of symbols that concatenate into strings (also called "words"). Words that belong to a particular formal language are sometimes called Formal language#Definition, ''well-formed words''. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar. 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 meanings or semantics. In computational complexity theory, decision problems are typically defined as formal languages, and complexity classes are defined as the sets of the formal languages that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Academia Europaea
The Academia Europaea is a pan-European Academy of humanities, letters, law, and sciences. The Academia was founded in 1988 as a functioning Europe-wide Academy that encompasses all fields of scholarly inquiry. It acts as co-ordinator of European interests in national research agencies. History The concept of a 'European Academy of Sciences' was raised at a meeting in Paris of the European Ministers of Science in 1985. The initiative was taken by the Royal Society (United Kingdom) which resulted in a meeting in London in June 1986 of Arnold Burgen (United Kingdom), Hubert Curien (France), Umberto Colombo (Italy), David Magnusson (Sweden), Eugen Seibold (Germany) and Ruurd van Lieshout (the Netherlands) – who agreed to the need for a new body. The meeting also included Brian Flowers and John Kendrew. Another, larger meeting took place in October 1986 with participants representing some countries in the Council of Europe and was in support for the development of a Eur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Scientists
A theory is a systematic and rational form of abstract thinking about a phenomenon, or the conclusions derived from such thinking. It involves contemplative and logical reasoning, often supported by processes such as observation, experimentation, and research. Theories can be scientific, falling within the realm of empirical and testable knowledge, or they may belong to non-scientific disciplines, such as philosophy, art, or sociology. In some cases, theories may exist independently of any formal discipline. In modern science, the term "theory" refers to Scientific theory, scientific theories, a well-confirmed type of explanation of nature, made in a way Consistency, consistent with the scientific method, and fulfilling the Scientific theory#Characteristics of theories, criteria required by modern science. Such theories are described in such a way that scientific tests should be able to provide Empirical evidence, empirical support for it, or Empirical evidence, empirical contradi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
French Computer Scientists
French may refer to: * Something of, from, or related to France ** French language, which originated in France ** French people, a nation and ethnic group ** French cuisine, cooking traditions and practices Arts and media * The French (band), a British rock band * "French" (episode), a live-action episode of ''The Super Mario Bros. Super Show!'' * ''Française'' (film), a 2008 film * French Stewart (born 1964), American actor Other uses * French (surname), a surname (including a list of people with the name) * French (tunic), a type of military jacket or tunic * French's, an American brand of mustard condiment * French (catheter scale), a unit of measurement * French Defence, a chess opening * French kiss, a type of kiss See also * France (other) * Franch, a surname * French Revolution (other) * French River (other), several rivers and other places * Frenching (other) * Justice French (other) Justice French may refer to: * C. G ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Purpose: Because living persons may suffer personal harm from inappropriate information, we should watch their articles carefully. By adding an article to this category, it marks them with a notice about sources whenever someone tries to edit them, to remind them of WP:BLP (biographies of living persons) policy that these articles must maintain a neutral point of view, maintain factual accuracy, and be properly sourced. Recent changes to these articles are listed on Special:RecentChangesLinked/Living people. Organization: This category should not be sub-categorized. Entries are generally sorted by family name In many societies, a surname, family name, or last name is the mostly hereditary portion of one's personal name that indicates one's family. It is typically combined with a given name to form the full name of a person, although several give .... Maintenance: Individuals of advanced age (over 90), for whom there has been no new documentation in the last ten ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1947 Births
It was the first year of the Cold War, which would last until 1991, ending with the dissolution of the Soviet Union. Events January * January–February – Winter of 1946–47 in the United Kingdom: The worst snowfall in the country in the 20th century causes extensive disruption of travel. Given the low ratio of private vehicle ownership at the time, it is mainly remembered in terms of its effects on the railway network. * January 1 – The ''Canadian Citizenship Act, 1946, Canadian Citizenship Act'' comes into effect, providing a Canadian citizenship separate from British law. * January 4 – First issue of weekly magazine ''Der Spiegel'' published in Hanover, Germany, edited by Rudolf Augstein. * January 10 – The United Nations adopts a resolution to take control of the free city of Trieste. * January 15 – Elizabeth Short, an aspiring actress nicknamed the "Black Dahlia", is found brutally murdered in a vacant lot in Los Angeles; the mysterious case is never solv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Language Theory
In logic, mathematics, computer science, and linguistics, a formal language is a set of string (computer science), strings whose symbols are taken from a set called "#Definition, alphabet". The alphabet of a formal language consists of symbols that concatenate into strings (also called "words"). Words that belong to a particular formal language are sometimes called Formal language#Definition, ''well-formed words''. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar. 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 meanings or semantics. In computational complexity theory, decision problems are typically defined as formal languages, and complexity classes are defined as the sets of the formal languages that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arto Salomaa
Arto Kustaa Salomaa (6 June 1934 – 26 January 2025) was a Finnish mathematician and computer scientist. His research career, which spanned over 40 years, was focused on formal languages and automata theory. Early life and education Salomaa was born in Turku, Finland on 6 June 1934. He earned a Bachelor's degree from the University of Turku in 1954 and a PhD from the same university in 1960. Salomaa's father was a professor of philosophy at the University of Turku. Salomaa was introduced to the theory of automata and formal languages during seminars at Berkeley given by John Myhill in 1957. Career In 1965 Salomaa became a professor of mathematics at the University of Turku, a position he retired from in 1999. He also spent two years in the late 1960s at the University of Western Ontario in London, Ontario, Canada, and two years in the 1970s at Aarhus University in Aarhus, Denmark.. Salomaa was president of the European Association for Theoretical Computer Science ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
EATCS
The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science. The major activities of the EATCS are: * Organization of ICALP, the International Colloquium on Automata, Languages and Programming;Brauer, Ute; Brauer, WilfriedEuropean Association for Theoretical Computer Science / About the Association / Silver Jubilee of EATCS/ref> * Publication of the ''Bulletin of the EATCS''; * Publication of a series of monographs and texts on theoretical computer science; * Publication of the journal ''Theoretical Computer Science''; * Publication of the journal '' Fundamenta Informaticae''. EATCS Award Each year, the EATCS Award is awarded in recognition of a distinguished career in theoretical computer science ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
École Polytechnique
(, ; also known as Polytechnique or l'X ) is a ''grande école'' located in Palaiseau, France. It specializes in science and engineering and is a founding member of the Polytechnic Institute of Paris. The school was founded in 1794 by mathematician Gaspard Monge during the French Revolution and was militarized under Napoleon I in 1804. It is still supervised by the Ministry of Armed Forces (France), French Ministry of Armed Forces. Originally located in the Latin Quarter, Paris, Latin Quarter in central Paris, the institution moved to Palaiseau in 1976, in the Paris-Saclay, Paris-Saclay technology cluster. French engineering students undergo initial military training and have the status of paid Aspirant, officer cadets. The school has also been awarding doctorates since 1985, masters since 2005 and bachelors since 2017. Most Polytechnique engineering graduates go on to become top executives in companies, senior civil servants, military officers, or researchers. List of É ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semigroup Theory
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively (just notation, not necessarily the elementary arithmetic multiplication): , or simply ''xy'', denotes the result of applying the semigroup operation to the ordered pair . Associativity is formally expressed as that for all ''x'', ''y'' and ''z'' in the semigroup. Semigroups may be considered a special case of magmas, where the operation is associative, or as a generalization of groups, without requiring the existence of an identity element or inverses. As in the case of groups or magmas, the semigroup operation need not be commutative, so is not necessarily equal to ; a well-known example of an operation that is associative but non-commutative is matrix multiplication. If the semigroup operation is commutative, then the semigroup is called a ''commutative semigroup'' o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
