Author
Grzegorz Rozenberg
Other affiliations: Åbo Akademi University, University of Warsaw, University of Antwerp ...read more
Bio: 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 published on a yearly basis
Papers
More filters
Proceedings Article•
01 Jan 1998TL;DR: It is inferred that any recursively enumerable language can be represented as the projection of the intersection of two minimal linear languages.
Abstract: We introduce two-sided sticker systems, the two-sided variant of a computability model introduced as an abstraction of Adleman's style of DNA computing and of the matching of the so-called Watson-Crick complements. Several types of sticker systems are shown to have the same power as regular grammars, one variant is found to represent the linear languages, and another one is proved to be able to represent any recursively enumerable language. From this result we infer that any recursively enumerable language can be represented as the projection of the intersection of two minimal linear languages.
22 citations
TL;DR: It is proved that T-structures are a natural generalization of linear orders; in particular, it is proven that a T-structure can be represented by two linear orders.
22 citations
TL;DR: It is shown that membrane systems which differ from conventional membrane systems by the following features are computationally universal and that if only the second feature is used then one can generate at least the family of Parikh images of the languages generated by programmed grammars without appearance checking.
22 citations
04 Oct 1982
TL;DR: A word over the alphabet {l,r,u,d} is a picture description in the sense that it represents a traversal of a picture where the interpretation of the symbols l, r, u,d is: l — go (and draw) one unit line to the left of the current point.
Abstract: A picture is a connected set of axis parallel unit lines from the Cartesian plane considered as a square grid. A word over the alphabet {l,r,u,d} is a picture description in the sense that it represents a traversal of a picture where the interpretation of the symbols l,r,u,d is: l — go (and draw) one unit line to the left of the current point; r,u, and d are interpreted analogously with “left” replaced by “right”, “up”, and “down”, respectively. This is one of the chain codemodels.
22 citations
Book•
01 Jan 2006
TL;DR: The power of dissolution in P Systems with Active Membranes, and the Modeling of Biochemical Oscillations.
Abstract: Invited Lectures.- Computational Power of Symport/Antiport: History, Advances, and Open Problems.- Structural Operational Semantics of P Systems.- Some Recent Results Concerning Deterministic P Systems.- Membrane Algorithms.- On Evolutionary Lineages of Membrane Systems.- Regular Presentations.- Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness.- Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules.- On P Systems as a Modelling Tool for Biological Systems.- Encoding-Decoding Transitional Systems for Classes of P Systems.- On the Computational Power of the Mate/Bud/Drip Brane Calculus: Interleaving vs. Maximal Parallelism.- A Membrane Computing System Mapped on an Asynchronous, Distributed Computational Environment.- P Systems with Memory.- Algebraic and Coalgebraic Aspects of Membrane Computing.- P Systems and the Modeling of Biochemical Oscillations.- P Systems, Petri Nets, and Program Machines.- On the Power of Dissolution in P Systems with Active Membranes.- A Linear Solution for QSAT with Membrane Creation.- On Symport/Antiport P Systems and Semilinear Sets.- Boolean Circuits and a DNA Algorithm in Membrane Computing.- Towards a Petri Net Semantics for Membrane Systems.- Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes.- Editing Distances Between Membrane Structures.- Relational Membrane Systems.- On the Rule Complexity of Universal Tissue P Systems.- Non-cooperative P Systems with Priorities Characterize PsET0L.
22 citations
Cited by
More filters
01 Apr 1989
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Abstract: Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >
10,755 citations
Journal Article•
9,185 citations
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
7,096 citations
Book•
18 Dec 1991
3,409 citations