Grzegorz Rozenberg

Last updated
Grzegorz Rozenberg
Grzegorz Rozenberg.jpg
2017, with his decoration of a Knight of the Order of the Netherlands Lion
Born (1942-03-14) March 14, 1942 (age 82)
Warsaw
Alma mater Polish Academy of Sciences
Scientific career
Fields Computer science
Institutions Leiden University
Thesis Quasi-uniform Automata  (1968)
Doctoral advisor Zdzisław Pawlak
Doctoral students Jetty Kleijn

Grzegorz Rozenberg (born 14 March 1942, Warsaw) [1] is a Polish and Dutch computer scientist. [2] [3]

Contents

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. [4] [5]

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 University of Technology in Warsaw, Poland. He obtained a Ph.D. in mathematics from the Polish Academy of Sciences also in Warsaw in 1968. [3] Since then he has held full-time positions at the Polish Academy of Sciences, Warsaw, Poland (assistant professor), Utrecht University, The Netherlands (assistant professor), State University of New York at Buffalo, USA (associate professor), and University of Antwerp (UIA), Belgium (professor). Since 1979 he has been a professor of computer science at Leiden University, The Netherlands and adjoint professor at the Department of Computer Science of University of Colorado at Boulder, US.

Publications and editorial functions

Rozenberg has authored over 500 papers, 6 books, and (co-)edited over 100 books and special issues of scientific journals. [6]

He was also a (co-)editor of four handbooks: "Handbook of Formal Languages" (3 volumes, Springer-Verlag), "Handbook of Graph Grammars and Computing by Graph Transformation", [7] [8] [9] "Handbook of Membrane Computing" (Oxford University Press), and the "Handbook of Natural Computing" (4 volumes, Springer-Verlag).

He is on the editorial/advisory board of about 20 journals, and is the editor-in-chief and either the founder or a co-founder of the following journals and book series: International Journal on Natural Computing (Springer-Verlag), Theoretical Computer Science C: Theory of Natural Computing (Elsevier), Monographs in Theoretical Computer Science (Springer-Verlag), Texts in Theoretical Computer Science (Springer-Verlag), and Natural Computing book Series (Springer-Verlag).

Functions in the academic community

G. Rozenberg either founded or co-founded and/or was the chair of the following conferences: International Conference on Developments in Language Theory, International Conference on Graph Transformation, International Conference on Unconventional Computation, International Conference on Theory and Applications of Petri Nets, and the International Meeting on DNA Computing.

Rozenberg was president of the European Association for Theoretical Computer Science from 1985 to 1994 (the longest term in that position) and the editor of the Bulletin of the European Association for Theoretical Computer Science from 1980 until 2003. [4] He also was the president of the International Society for Nanoscale Science, Computation and Engineering, the director of European Molecular Computing Consortium, and the chair of European Educational Forum.

Awards and recognition

G. Rozenberg is a Foreign Member of the Finnish Academy of Sciences and Letters, a member of Academia Europaea, and the holder of Honorary Doctorates of the University of Turku, Finland, Technische Universität Berlin, Germany, the University of Bologna, Italy, the Swedish University Åbo Akademi in Turku, Finland, and the Warsaw University of Technology, Poland. He has received the Distinguished Achievements Award of the European Association for Theoretical Computer Science "in recognition of his outstanding scientific contributions to theoretical computer science". [6] He is an ISI highly cited researcher.

Several books and special issues of scientific journals have been dedicated to G. Rozenberg. [2] [3] [5] [10] Also an annual award granted by International Society for Nanoscale Science, Computation, and Engineering was named after G. Rozenberg. It is called Rozenberg Tulip Award and it is awarded for outstanding achievements in the field of Biomolecular Computing and Molecular Programming.

In 2017, Grzegorz Rozenberg has been appointed Knight in the Order of the Netherlands Lion.

Related Research Articles

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering to layout algorithms and picture generation.

<span class="mw-page-title-main">Przemysław Prusinkiewicz</span> Polish computer scientist

Przemysław (Przemek) Prusinkiewicz is a Polish computer scientist who advanced the idea that Fibonacci numbers in nature can be in part understood as the expression of certain algebraic constraints on free groups, specifically as certain Lindenmayer grammars. Prusinkiewicz's main work is on the modeling of plant growth through such grammars.

ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.

A bigraph can be modelled as the superposition of a graph and a set of trees.

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.

In computer science, in particular in the field of formal language theory, an abstract family of languages is an abstract mathematical notion generalizing characteristics common to the regular languages, the context-free languages and the recursively enumerable languages, and other families of formal languages studied in the scientific literature.

<span class="mw-page-title-main">Arto Salomaa</span> Finnish mathematician and computer scientist

Arto Kustaa Salomaa is a Finnish mathematician and computer scientist. His research career, which spans over forty years, is focused on formal languages and automata theory.

Andrzej Ehrenfeucht is a Polish-American mathematician and computer scientist.

DLT, the International Conference on Developments in Language Theory is an academic conference in the field of computer science held annually under the auspices of the European Association for Theoretical Computer Science. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Extended versions of selected papers of each year's conference appear in international journals, such as Theoretical Computer Science and International Journal of Foundations of Computer Science.

<span class="mw-page-title-main">Janusz Brzozowski (computer scientist)</span> Polish-Canadian computer scientist (1935–2019)

Janusz (John) Antoni Brzozowski was a Polish-Canadian computer scientist and Distinguished Professor Emeritus at the University of Waterloo's David R. Cheriton School of Computer Science.

In computer science, double pushout graph rewriting refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973). It has since been generalized to allow rewriting structures which are not graphs, and to handle negative application conditions, among other extensions.

A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms. Term graphs are a more powerful form of representation than expression trees because they can represent not only common subexpressions but also cyclic/recursive subexpressions.

Hans-Jörg Kreowski is a professor for computer science at the University of Bremen in North West Germany. His primary research area is theoretical computer science with an emphasis on graph transformation, algebraic specification, and syntactic picture processing. He is also a member of the Forum of Computer Scientists for Peace and Social Responsibility (FIfF).

<span class="mw-page-title-main">Lutz Michael Wegner</span> German computer scientist

Lutz Michael Wegner is a German computer scientist.

<span class="mw-page-title-main">Ludwig Staiger</span> German mathematician and computer scientist

Ludwig Staiger is a German mathematician and computer scientist at the Martin Luther University of Halle-Wittenberg.

In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast to the double-pushout approach of graph rewriting.

In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes. In the algebraic approach to graph grammars, they are usually formulated using the double-pushout approach or the single-pushout approach.

Nataša Jonoska is a Macedonian mathematician and professor at the University of South Florida known for her work in DNA computing. Her research is about how biology performs computation, "in particular using formal models such as cellular or other finite types of automata, formal language theory symbolic dynamics, and topological graph theory to describe molecular computation".

<span class="mw-page-title-main">Kai Salomaa</span> Finnish Canadian theoretical computer scientist

Kai Tapani Salomaa is a Finnish Canadian theoretical computer scientist, known for his numerous contributions to the state complexity of finite automata. His highly cited 1994 joint paper with Yu and Zhuang laid the foundations of the area. He has published over 100 papers in scientific journals on various subjects in formal language theory. Salomaa is a full professor at Queen's University.

Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars.

References

  1. ↑ Grzegorz Rozenberg at Leiden University website.
  2. 1 2 Ausiello, Giorgio; Hoogeboom, Hendrik Jan; Karhumäki, Juhani; Petre, Ion; Salomaa, Arto (2012). Magic in Science. Special Issue of Theoretical Computer Science. Vol. 429. Elsevier. p. 304.
  3. 1 2 3 G. Rozenberg (1999). "The Magic of Theory and the Theory of Magic". In C. S. Calude (ed.). People and Ideas in Theoretical Computer Science. Springer. pp. 227–252.
  4. 1 2 Arto Salomaa (2009), "Grzegorz Rozenberg: A Magical Scientist and Brother", in Condon, Anne; Harel, David; Kok, Joost N.; Salomaa, Arto; Winfree, Erik (eds.), Algorithmic Bioprocesses, Natural Computing Series, Bibcode:2009albi.book.....C, doi:10.1007/978-3-540-88869-7, ISBN   978-3-540-88868-0
  5. 1 2 Condon, Anne; Harel, David; Kok, Joost N.; Salomaa, Arto; Winfree, Erik (2009). Algorithmic Bioprocesses. Festschrift Celebrating the 65th Birthday of Grzegorz Rozenberg. Natural Computing Series. Springer-Verlag. p. 742.
  6. 1 2 van Leeuwen, Jan (2003), "EATCS Awards 2003" (PDF), Bulletin of the European Association of Computer Science, 81: 14–15
  7. ↑ Grzegorz Rozenberg, ed. (Feb 1997). Foundations. Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 1. River Edge, NJ: World Scientific. doi:10.1142/3303. ISBN   978-981-02-2884-2.
  8. ↑ Hartmut Ehrig and Gregor Engels and Hans-Jörg Kreowski and Grzegorz Rozenberg, ed. (Oct 1999). Applications, Languages and Tools. Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 2. World Scientific. doi:10.1142/4180. ISBN   978-981-02-4020-2.
  9. ↑ Hartmut Ehrig and Hans-Jörg Kreowski and Ugo Montanari and Grzegorz Rozenberg, ed. (Aug 1999). Concurrency, Parallelism, and Distribution. Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 3. World Scientific. doi:10.1142/4181. ISBN   978-981-02-4021-9.
  10. ↑ Brauer, Wilfried; Ehrig, Hartmut; Karhumäki, Juhani; Salomaa, Arto (2002). Formal and Natural Computing. Essays Dedicated to G. Rozenberg. Springer-Verlag. p. 430.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.