G
Grzegorz Rozenberg
Researcher at Leiden University
Publications - 679
Citations - 31971
Grzegorz Rozenberg is an academic researcher from Leiden University. The author has contributed to research in topics: Petri net & Formal language. The author has an hindex of 81, co-authored 679 publications receiving 31378 citations. Previous affiliations of Grzegorz Rozenberg include Åbo Akademi University & University of Warsaw.
Papers
More filters
New Frontiers in Scientific Discovery. Commemorating the Life and Work of Zdzislaw Pawlak
Ewa Orłowska,James F. Peters,Grzegorz Rozenberg,Andrzej Skowron,P. Balbiani,D. Vakarelov,J. G. Bazan,P. Kruczek,S. Bazan Socha,J. J. Pietrzyk,F. Bernardini,R. Brijder,C. Zandron,D. Bianucci,G. Cattaneo,D. Ciucci,W. Buszkowski,M. K. Chakraborty,M. Banerjee,H. Chen,R. Freund,M. Ionescu,B. Paun,M. J. Perez Jimenez,S. Demri,P. Doherty,A. Szalas,D. Dubois,F. Dupin de Saint Cyr,H. Prade,Ivo Düntsch,B. Konikowska,M. Dziubinski,R. Verbrugge,B. Dunin Keplicz,Andrzej Ehrenfeucht,D. Gohring,H. D. Burkhard,R. Janicki,D. T. M. Le,J. Jarvinen,S. Marcus,A. Mazurkiewicz,M. J. Moshkov,M. Piliszczuk,B. Zielosko,M. Novotny,S. Oshuga,Lech Polkowski,Sheela Ramanna,A. Solomaa,D. Sen,Sankar K. Pal,W. Skarbek,J. Wonkowski +54 more
Journal ArticleDOI
Reductions For Primitive 2-Structures
Tero Harju,Grzegorz Rozenberg +1 more
TL;DR: A subset X of a 2-structure g is a clan, if X cannot be distinguished by colors from outside of X if g is primitive, i.e. it has no nontrivial clans, then there exists an edge e or an end vertex x such that when e or x is removed from g, the resulting 2-Structure g′ remains primitive.
BookDOI
Membrane computing: 16th international conference, CMC 2015 Valencia, Spain, August 17–21, 2015 revised selected papers
TL;DR: It turns out that information entropy, mutual information, entropic divergences, codes, and dictionaries are fundamental tools for extracting the biological information on which biological functionalities are based on.
Journal ArticleDOI
Application of Mismatch Detection Methods in DNA Computing
TL;DR: A heteroduplex migration assay and enzymatic detection of mismatches on a 4 variable instance of 3SAT, using a previously described blocking algorithm and a CEL I mismatch endonuclease assay are benchmarked.
Journal ArticleDOI
Transitivity of local complementation and switching on graphs
TL;DR: It is proved that the compositions δ x = λ x C (for vertices x ∈ D ) generate a transitive group on the graphs with vertex set D, that is, for any two graphs g and h on D, there exists a composition α of operationsδ x such that h = α ( g ).