|
Trace Theory
In mathematics and computer science, trace theory aims to provide a concrete mathematical underpinning for the study of concurrent computation and process calculi. The underpinning is provided by an algebraic definition of the free partially commutative monoid or trace monoid, or equivalently, the history monoid, which provides a concrete algebraic foundation, analogous to the way that the free monoid provides the underpinning for formal languages. The power of trace theory stems from the fact that the algebra of dependency graphs (such as Petri nets) is isomorphic to that of trace monoids, and thus, one can apply both algebraic formal language tools, as well as tools from graph theory. While the trace monoid had been studied by Pierre Cartier and Dominique Foata for its combinatorics in the 1960s, trace theory was first formulated by Antoni Mazurkiewicz in the 1970s, in an attempt to evade some of the problems in the theory of concurrent computation, including the probl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Trace (linguistics)
Syntactic movement is the means by which some theories of syntax address discontinuities. Movement was first postulated by structuralist linguists who expressed it in terms of ''discontinuous constituents'' or ''displacement''. Some constituents appear to have been displaced from the position in which they receive important features of interpretation. The concept of movement is controversial and is associated with so-called ''transformational'' or ''derivational'' theories of syntax (such as transformational grammar, government and binding theory, minimalist program). Representational theories (such as head-driven phrase structure grammar, lexical functional grammar, construction grammar, and most dependency grammars), in contrast, reject the notion of movement and often instead address discontinuities with other mechanisms including graph reentrancies, feature passing, and type shifters. Illustration Movement is the traditional means of explaining discontinuities such as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Isomorphic
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσος ''isos'' "equal", and μορφή ''morphe'' "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects are . An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if there is only one isomorphism between the two structures (as it is the case for solutions of a univer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Concurrent Computing
Concurrent computing is a form of computing in which several computations are executed '' concurrently''—during overlapping time periods—instead of ''sequentially—''with one completing before the next starts. This is a property of a system—whether a program, computer, or a network—where there is a separate execution point or "thread of control" for each process. A ''concurrent system'' is one where a computation can advance without waiting for all other computations to complete. Concurrent computing is a form of modular programming. In its paradigm an overall computation is factored into subcomputations that may be executed concurrently. Pioneers in the field of concurrent computing include Edsger Dijkstra, Per Brinch Hansen, and C.A.R. Hoare. Introduction The concept of concurrent computing is frequently confused with the related but distinct concept of parallel computing, Pike, Rob (2012-01-11). "Concurrency is not Parallelism". ''Waza conference'', 11 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
LNCS
''Lecture Notes in Computer Science'' is a series of computer science books published by Springer Science+Business Media since 1973. Overview The series contains proceedings, post- proceedings, monographs, and Festschrift In academia, a ''Festschrift'' (; plural, ''Festschriften'' ) is a book honoring a respected person, especially an academic, and presented during their lifetime. It generally takes the form of an edited volume, containing contributions from the ...s. In addition, tutorials, state-of-the-art surveys, and "hot topics" are increasingly being included. The series is indexed by DBLP. See also *'' Monographiae Biologicae'', another monograph series published by Springer Science+Business Media *'' Lecture Notes in Physics'' *'' Lecture Notes in Mathematics'' *'' Electronic Workshops in Computing'', published by the British Computer Society References External links * Publications established in 1973 Computer science books Series of non-fiction books ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Arto Salomaa
Arto K. Salomaa (born 6 June 1934) is a Finnish mathematician and computer scientist. His research career, which spans over forty years, is focused on formal languages and automata theory. Early life and education Salomaa was born in Turku, Finland on June 6, 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 from 1979 until 1985. Public ... [...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 Univer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Volker Diekert
{{disambiguation ...
Volker may refer to: * Volker (name), including a list of people with the given name or surname * Volker, Kansas City, a historic neighborhood in Kansas City * Volker Boulevard, Kansas City * ''Alien Nations'' (German: ''Die Völker''), a real-time strategy video game released in 1999 See also * VolkerWessels, a Dutch construction company ** VolkerRail, a railway infrastructure services company based in Doncaster, England, owned by VolkerWessels * Voelcker (other) * Voelker (other) Voelker is a surname. Notable people with the surname include: * Joe Voelker (Born 1987), and Mike Voelker (Born 1982), Famous brothers from Florida * Bobby Voelker (born 1979), American mixed martial artist * Christopher Voelker (born 1961), Amer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Antoni Mazurkiewicz
Antoni is a Catalan, Polish, and Slovene given name and a surname used in the eastern part of Spain, Poland and Slovenia. As a Catalan given name it is a variant of the male names Anton and Antonio. As a Polish given name it is a variant of the female names Antonia and Antonina. As a Slovene name it is a variant of the male names Anton, Antonij and Antonijo and the female name Antonija. As a surname it is derived from the Antonius root name. It may refer to: Given name * Antoni Brzeżańczyk, Polish football player and manager * Antoni Derezinski, Northern Irish Strongman * Antoni Gaudi, Catalan architect * Antoni Kenar, Polish sculptor * Antoni Lima, Catalan footballer * Antoni Lomnicki, Polish mathematician * Antoni Melchior Fijałkowski, Polish bishop * Antoni Niemczak, Polish long-distance runner * Józef Antoni Poniatowski, Polish prince and Marshal of France * Antoni Porowski, Polish-Canadian chef, actor, and television personality * Antoni Radziwiłł, Polish poli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Dominique Foata
Dominique Foata (born October 12, 1934) is a mathematician who works in enumerative combinatorics. With Pierre Cartier and Marcel-Paul Schützenberger he pioneered the modern approach to classical combinatorics, that lead, in part, to the current blossoming of algebraic combinatorics. His pioneering work on permutation statistics, and his combinatorial approach to special functions, are especially notable. Foata gave an invited talk at the International Congress of Mathematicians in Warsaw (1983). Among his honors are the Scientific Prize of the Union des Assurances de Paris (September 1985). With Adalbert Kerber and Volker Strehl he founded the mathematics journal '' Séminaire Lotharingien de Combinatoire''. He is also one of the contributors of the pseudonymous collective M. Lothaire. In 1985, Foata received the Prix Paul Doistau–Émile Blutet. He was born in Damascus while it was under French mandate. Selected publications Books * with Pierre Cartier : ''Problèmes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Pierre Cartier (mathematician)
Pierre Émile Cartier (born 10 June 1932) is a French mathematician. An associate of the Bourbaki group and at one time a colleague of Alexander Grothendieck, his interests have ranged over algebraic geometry, representation theory, mathematical physics, and category theory. He studied at the École Normale Supérieure in Paris under Henri Cartan and André Weil. Since his 1958 thesis on algebraic geometry he has worked in a number of fields. He is known for the introduction of the Cartier operator in algebraic geometry in characteristic ''p'', and for work on duality of abelian varieties and on formal groups. He is the eponym of Cartier divisors and Cartier duality. From 1961 to 1971 he was a professor at the University of Strasbourg. In 1970 he was an Invited Speaker at the International Congress of Mathematicians in Nice. He was awarded the 1978 Prize Ampère of the French Academy of Sciences. In 2012 he became a fellow of the American Mathematical Society. Publicati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Graph Theory
In mathematics, graph theory is the study of '' graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by ''edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |