|
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] |
Turku
Turku ( ; ; , ) is a city in Finland and the regional capital of Southwest Finland. It is located on the southwestern coast of the country at the mouth of the Aura River (Finland), River Aura. The population of Turku is approximately , while the Turku metropolitan area, metropolitan area has a population of approximately . It is the most populous Municipalities of Finland, municipality in Finland, and the third most populous List of urban areas in Finland by population, urban area in the country after Helsinki metropolitan area, Helsinki and Tampere metropolitan area, Tampere. Turku is Finland's oldest city. It is not known when Turku was granted city status. Pope Pope Gregory IX, Gregory IX first mentioned the town of ''Aboa'' in his ''Bulla'' in 1229, and this year is now used as the founding year of the city. Turku was the most important city in the eastern part of the Sweden, Kingdom of Sweden (today's Finland). After the Finnish War, Finland became an Grand Duchy of Finla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Myhill
John R. Myhill Sr. (11 August 1923 – 15 February 1987) was a British mathematician. Education Myhill received his Ph.D. from Harvard University under the supervision of Willard Van Orman Quine in 1949. He was a professor at SUNY Buffalo from 1966 until his death in 1987. He also taught at several other universities during his career. His son, also called John Myhill, is a professor of linguistics in the English department of the University of Haifa in Israel. Contributions In the theory of formal languages, the Myhill–Nerode theorem, proven by Myhill and Anil Nerode, characterizes the regular languages as the languages that have only finitely many inequivalent prefixes. In computability theory, the Rice–Myhill–Shapiro theorem, more commonly known as Rice's theorem, states that, for any nontrivial property ''P'' of partial functions, it is undecidable whether a given Turing machine computes a function with property ''P''. The Myhill isomorphism theorem is a comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
DNA Computing
DNA computing is an emerging branch of unconventional computing which uses DNA, biochemistry, and molecular biology hardware, instead of the traditional electronic computing. Research and development in this area concerns theory, experiments, and applications of DNA computing. Although the field originally started with the demonstration of a computing application by Len Adleman in 1994, it has now been expanded to several other avenues such as the development of storage technologies, nanoscale imaging modalities, synthetic controllers and reaction networks, etc. History Leonard Adleman of the University of Southern California initially developed this field in 1994. — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem. Also available here: Adleman demonstrated a proof-of-concept use of DNA as a form of computation which solved the seven-point Hamiltonian path problem. Since the initial Adleman experiments, advances have occur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Public Key Cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security. There are many kinds of public-key cryptosystems, with different security goals, including digital signature, Diffie–Hellman key exchange, public-key key encapsulation, and public-key encryption. Public key algorithms are fundamental security primitives in modern cryptosystems, including applications and protocols that offer assurance of the confidentiality and authenticity of electronic communications and data storage. They underpin numerous Internet standards, such as Transport Layer Security (TLS), SSH, S/MIME, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grzegorz Rozenberg
Grzegorz Rozenberg (born 14 March 1942, Warsaw) is a Polish and Dutch computer scientist. His primary research areas are natural computing, formal language and automata theory, graph transformations, and concurrent systems. He is referred to as the guru of natural computing, as he was promoting the vision of natural computing as a coherent scientific discipline already in the 1970s, gave this discipline its current name, and defined its scope. His research career spans over forty five years. He is a professor at the Leiden Institute of Advanced Computer Science of Leiden University, The Netherlands and adjoint professor at the department of computer science, University of Colorado at Boulder, USA. Rozenberg is also a performing magician, with the artist name Bolgani and specializing in close-up illusions. He is the father of well-known Dutch artist Dadara. Education and career Rozenberg received his Master and Engineer degrees in computer science from the Warsaw Univ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
L Systems
An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make strings, a collection of production rules that expand each symbol into some larger string of symbols, an initial "axiom" string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the University of Utrecht. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes of plant development. L-systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals. Origins As a biologist, Lindenmayer worked with yeast and filamentous fungi and studied the growth patterns of various types of bacteria, such as the cyanobacteria '' Anabaena c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Languages
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] |
Automata Theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical logic. The word ''automata'' comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the ... [...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] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second-largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aarhus
Aarhus (, , ; officially spelled Århus from 1948 until 1 January 2011) is the second-largest city in Denmark and the seat of Aarhus municipality, Aarhus Municipality. It is located on the eastern shore of Jutland in the Kattegat sea and approximately northwest of Copenhagen. Dating back to the late 8th century, Aarhus was founded as a harbour settlement at the mouth of the Aarhus River and quickly became a trade hub. The first Christian church was built here around the year 900 and later in the Viking Age the town was fortified with defensive ramparts. The Ancient See of Aarhus, bishopric of Aarhus grew steadily stronger and more prosperous, building several religious institutions in the town during the early Middle Ages. Trade continued to improve, although it was not until 1441 that Aarhus was granted market town privileges, and the population of Aarhus remained relatively stable until the 19th century. The city began to grow significantly as trade prospered in the mid-18 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aarhus University
Aarhus University (, abbreviated AU) is a public research university. Its main campus is located in Aarhus, Denmark. It is the second largest and second oldest university in Denmark. The university is part of the Coimbra Group, the Guild, and Utrecht Network of European universities and is a member of the European University Association. The university was founded in 1928 in Aarhus, Denmark. It comprises five faculties, Arts, Natural Sciences, Technical Sciences, Health, and Business and Social Sciences, and a total of twenty-seven departments. It is home to over thirty internationally recognised research centres, including fifteen centres of excellence funded by the Danish National Research Foundation. The university's alumni include Bjarne Stroustrup, the inventor of programming language C++; Queen Margrethe II of Denmark; King Frederik X of Denmark; and Anders Fogh Rasmussen, former prime minister of Denmark and secretary general of NATO. Nobel Laureate Jens Christi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
