Showing papers by "Grzegorz Rozenberg published in 1997"

Handbook of Formal Languages

Abstract: The theory of formal languages is the oldest and most fundamental area of theoretical computer science. It has served as a basis of formal modeling from the early stages of programming languages to the recent beginnings of DNA computing. This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field. Best specialists of various subareas, altogether 50 in number, are among the authors. The maturity of the field makes it possible to include a historical perspective in many presentations. The individual chapters can be studied independently, both as a text and as a source of reference. The Handbook is an invaluable aid for advanced students and specialists in theoretical computer science and related areas in mathematics, linguistics, and biology.

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Abstract: A graph program consists of declarations of conditional graph transformation rules G. Rozenberg, editors: Handbook of Graph Grammars and Computing. We introduce s-graph grammars, a new grammar formalism for computing Handbook of Graph Grammars and Computing by Graph Transformation, pp. The double-pushout approach to graph transformation, which was invented in the early 1970's, is Handbook of Graph Grammars and Computing by Graph.

2-structures—a framework for decomposition and transformation of graphs

Abstract: The theory of 2-structures provides a convenient framework for decomposition and transformation of mathematical systems where one or several different binary relationships hold between the objects of the system. In particular, it forms a useful framework for decomposition and transformation of graphs.The decomposition methods presented in this book correspond closely to the top-down design methods studied in computer science. The transformation methods considered here have a natural interpretation in the dynamic evolution of certain kinds of communication networks. From the mathematical point of view, the clan decomposition method presented here, also known as modular decomposition or substitution decomposition, is closely related to the decomposition by quotients in algebra. The transformation method presented here is based on labelled 2-structures over groups, the theory of which generalizes the well-studied theory of switching classes of graphs.This book is both a text and a monograph. As a monograph, the results concerning the decomposition and transformation of 2-structures are presented in a unified way. In addition, detailed notes on references are provided at the end of each chapter. These notes allow the reader to trace the origin of many notions and results, and to browse through the literature in order to extend the material presented in the book.To facilitate its use as a textbook, there are numerous examples and exercises which provide an opportunity for the reader to check his or her understanding of the discussed material. Furthermore, the text begins with preliminaries on partial orders, semigroups, groups and graphs to the extent needed for the book.

Handbook of formal languages, vol. 2: linear modeling: background and application

Abstract: This second volume of the Handbook of Formal Languages contains the most fundamental applications of language theory. Various aspects of linguistics and parsing, both natural and programming languages, symbolic manipulation, and pattern matching are discussed. A special feature is the recently very active field of DNA computing.

Word, language, grammar

Abstract: This first volume of the Handbook of Formal Languages gives a comprehensive authoritative exposition on the core of language theory. Grammars, codes, power series, L systems, and combinatorics on words are all discussed in a thorough, yet self-contained manner. This is perhaps the most informative single volume in the history of theoretical computer science.

Linear modeling : background and application

Abstract: of Volume 2.- 1. Complexity: A Language-Theoretic Point of View.- 2. Parsing of Context-Free Languages.- 3. Grammars with Controlled Derivations.- 4. Grammar Systems.- 5. Contextual Grammars and Natural Languages.- 6. Contextual Grammars and Formal Languages.- 7. Language Theory and Molecular Genetics.- 8. String Editing and Longest Common Subsequences.- 9. Automata for Matching Patterns.- 10. Symbolic Dynamics and Finite Automata.- 11. Cryptology: Language-Theoretic Aspects.

Computing by splicing: programmed and evolving splicing systems

Abstract: In the search for regulating mechanisms able to ensure computational universality for splicing systems and avoiding (some of the) non-realistic features of previous mechanisms of this type, we consider splicing systems with the splicing rules controlled by a next-rule mapping (like in programmed grammars). Then, this abstract model is "implemented" as a splicing system with the splicing rules themselves modified from a step to the next one by means of point mutations of the type one-symbol insertion/deletion.

Shuffle-like operations on ω-words

Abstract: We introduce and investigate some shuffle-like operations on ω-words and ω-languages. The approach is applicable to concurrency, providing a method to define the parallel composition of processes. It is also applicable to parallel computation. The operations are introduced using a uniform method based on the notion of an ω-trajectory. As a consequence, we obtain a very intuitive geometrical interpretation of the parallel composition operation. Our main results concern associativity. A rather surprising interconnection between associativity and periodicity will be exhibited.

Geometric Transformations of Language Families: The Power of Symmetry

Abstract: We consider certain isomorphisms between language families. When viewed as a group, the isomorphisms reduce to well-known geometric transformations. We obtain new characterizations for linear, simple matrix, simple contextual and trace languages. Our results make it possible to transfer results concerning languages in one family into results concerning languages in another family.

Invariants of inversive 2-structures on groups of labels

Abstract: For a finite set D of nodes let E2(D)={(x, y)mx, y∈D, x≠y}. We define an inversive Δ2-structure g as a function gE2(D)→Δ into a given group Δ satisfying the property g(x, y)=g(y, x)−1 for all (x, y)∈E2(D). For each function (selector) σD→Δ there is a corresponding inversive Δ2-structure gσ defined by gσ(x, y)=σ(x)·g(x, y)·σ(y)−1. A function η mapping each g into the group Δ is called an invariant if η(gσ)=η(g) for all g and σ. We study the group of free invariants η of inversive Δ2-structures, where η is defined by a word from the free monoid with involution generated by the set E 2(D). In particular, if Δ is abelian, the group of free invariants is generated by triangle words of the form (x0, x1)(x1, x2)(x2, x0).

Syntactic and Semantic Aspects of Parallelism

Abstract: We define and investigate new methods for the parallel composition of words and languages. The operation of parallel composition leads to new shuffle-like operations defined by syntactic constraints on the usual shuffle operation. The approach is applicable to concurrency, providing a method to define the parallel composition of processes. It is also applicable to parallel computation.

Semantics of nonsequential tree-based computation schemes

Abstract: We consider structured processes that compute changes of valuation functions defined for functional structures, where both the domain and range of each function are the set of sequences over a carrier set. By introducing consistency conditions and certain restrictions on the underlying graph, we obtain a determinism result guaranteeing that for each valuation the structured process computes a unique change of context, i.e., the process defines a partial function on the set of valuations. Employing the determinism theorem we obtain a decomposition result for interpreted trees using a structured process where the edges represent computations in the subtrees.