Grzegorz Rozenberg

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.

Context-Free Grammars with Graph Controlled Tables

Abstract: It is shown that every context-sensitive language can be generated by a context-free grammar with graph control over sets of productions. This can be done in two different ways, corresponding to unconditional transfer programmed grammars and programmed grammars with empty failure fields. Also some results concerning ordinary programmed grammars are established.

Contexts on Trajectories

Abstract: We introduce and investigate a new way of generating mildly context-sensitive languages. The main idea is that the contexts are adjoined by shuffling them on certain trajectories. In this way we obtain also a very general class of contextual grammars such that most of the fundamental classes of contextual grammars, for instance, internal contextual grammars, external contextual grammars, n-contextual grammars, are particular cases of contextual grammars with contexts shuffled on trajectories. The approach is very flexible, able to model various aspects from linguistics.

Coordinated pair systems ; part I : Dyck works and classical pumping

Abstract: The notion of a coordinated pair system, cp system for short, is a special instance of an ects System which in turn provides a common framework for quite a number of grammar and machine models encountered in the literature. In particular, the notion of a cp System corresponds very closely to (is another formulation of ) the notion of a push-down automaton. In this paper we continue the investigation of cp Systems and in particular we investigate the possibility of obtaining pumping properties of context-free languages via the analysis of computations in cp Systems. In order to do this we analyze the combinatorial structure of Dyck words. The properties of Dyck words we investigate stem from the combinatorial analysis of computations in cp Systems. We demonstrate how this correspondence can be used for proving the classical pumping lemma. Résumé. La notion de système de paires coordonné, abrégé en cp système, est un cas particulier de ects système qui, lui, fournit un cadre commun à un grand nombre de modèles de grammaires et de machines rencontrés dans la littérature. En particulier, la notion de cp système est très proche (est une autre formulation) de celle d'automate à pile. Dans cet article, nous continuons l'étude des cp systèmes, et nous étudions en particulier la possibilité d'obtenir des propriétés d'itération de langages algébriques à travers l'analyse des calculs dans les cp systèmes. Pour ce faire, nous analysons la structure combinatoire des mots de Dyck. Les propriétés des mots de Dyck que nous étudions proviennent d'une analyse combinatoire des calculs dans les cp systèmes. Nous montrons comment cette correspondance peut seqskèù démontrer le lemme d'itération classique.

Petri nets: Properties, analysis and applications

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. >