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
01 Apr 1994
TL;DR: Lindenmayer systems generalized to formal power series and their growth functions, and low-level tradeoffs between reversals and alternations in image generation and formal languages.
Abstract: Lindenmayer systems generalized to formal power series and their growth functions, W. Kuich on the power of L-systems in image generation, K. Culik II, J. Kari local equational logic, V.E. Cazanescu nondeterministic, probalistic and alternating computations on cellular array models, K. Kristhivasan, M. Mahajan low-level tradeoffs between reversals and alternations, K Iwama compositions of codings, D. Derencourt, A. Terlutte general formal systems, M. Kudlek rewriting extended regular expressions, V.M. Antimirov, P.D. Mosses two-dimensional languages and recognizable functions, D. Giammarresi fractals, dimension and formal languages, W. Merzenich, L. Staiger.
4 citations
27 Aug 2007
TL;DR: It is shown that the reduction graph can be defined within the GPRS if one restricts ourselves to the so-called realistic overlap graphs (which correspond to genes occurring in nature), which allows one to carry over from the SPRS to the G PRS several results that rely on the reductiongraph.
Abstract: The string pointer reduction system (SPRS) and the graph pointer reduction system (GPRS) are important formal models of gene assembly in ciliates. The reduction graph is a useful tool for the analysis of the SPRS, providing valuable information about the way that gene assembly is performed for a given gene. The GPRS is more abstract than the SPRS - not all information present in the SPRS is retained in the GPRS. As a consequence the reduction graph cannot be defined for the GPRS in general, but we show that it can be defined if we restrict ourselves to the so-called realistic overlap graphs (which correspond to genes occurring in nature). Defining the reduction graph within the GPRS allows one to carry over from the SPRS to the GPRS several results that rely on the reduction graph.
4 citations
Book•
19 Apr 2005
TL;DR: Modelling Dynamic Organization of Biology-Inspired Multi-agent Systems with Communicating X-Machines and Population P Systems and on the Size of P Systems with Minimal Symport/Antiport.
Abstract: Invited Lectures.- ?P Systems and Typed ?-Calculus.- P Automata.- Asynchronous P Systems and P Systems Working in the Sequential Mode.- Evolution and Oscillation in P Systems: Applications to Biological Phenomena.- An Approach to Computational Complexity in Membrane Computing.- LMNtal: A Language Model with Links and Membranes.- Regular Presentations.- Executable Specifications of P Systems.- On the Efficiency of P Systems with Active Membranes and Two Polarizations.- Communicative P Systems with Minimal Cooperation.- Ultimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts.- Unstable P Systems: Applications to Linguistics.- A P System Description of the Sodium-Potassium Pump.- Inhibiting/De-inhibiting Rules in P Systems.- Time-Independent P Systems.- On Two-Dimensional Mesh Networks and Their Simulation with P Systems.- Exploring Computation Trees Associated with P Systems.- Approximating Non-discrete P Systems.- Reducing the Size of Extended Gemmating P Systems.- P Systems Generating Trees.- On Descriptive Complexity of P Systems.- P Systems with Symport/Antiport: The Traces of RBCs.- Conservative Computations in Energy-Based P Systems.- General Multi-fuzzy Sets and Fuzzy Membrane Systems.- Trading Polarization for Bi-stable Catalysts in P Systems with Active Membranes.- Modelling Dynamic Organization of Biology-Inspired Multi-agent Systems with Communicating X-Machines and Population P Systems.- On the Size of P Systems with Minimal Symport/Antiport.
4 citations
TL;DR: This work characterize a labeled 2-structure h in terms of the prime tree of a labeled g which results from h by removing one element from h, which leads to an O(n3) algorithm for the construction of thePrime tree of g.
4 citations
TL;DR: It is demonstrated that each F induces a unique structure (scaffold) on f which determines how all "succint" coverings of f (by elements of F) are positioned on f.
Abstract: We study the problem of covering a word f by a set F of available segments. In particular we demonstrate that each F induces a unique structure (scaffold) on f which determines how all "succint" coverings of f (by elements of F) are positioned on f. Our motivation for this study comes from the formalization of the template–guided recombination which is a molecular operation that provides a solution for a molecular implementation of gene assembly in ciliates.
4 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