scientific article; zbMATH DE number 745858

Jozef Kelemen, Gheorghe Păun, Juergen Dassow, Erzsébet Csuhaj-Varjú

Publication date: 20 April 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Related Items (only showing first 100 items - show all)

Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\) ⋮ PC grammar systems with five context-free components generate all recursively enumerable languages. ⋮ Cooperating Distributed Tree Automata ⋮ A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems ⋮ On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata ⋮ On a hierarchy of languages generated by cooperating distributed grammar systems ⋮ CD grammar systems with competence based entry conditions in their cooperation protocols ⋮ Unnamed Item ⋮ Lower bound technique for length-reducing automata ⋮ Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ Quorum sensing P systems ⋮ P systems with minimal parallelism ⋮ On the power of permitting features in cooperating context-free array grammar systems ⋮ On the classes of languages characterized by generalized P colony automata ⋮ Unnamed Item ⋮ Cooperation in context-free grammars ⋮ Parallel communicating grammar systems with regular control and skeleton preserving FRR automata ⋮ Unnamed Item ⋮ CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages ⋮ Tissue P systems. ⋮ Probabilistic Parallel Communicating Grammar Systems ⋮ On CD-systems of stateless deterministic R-automata with window size one ⋮ Unnamed Item ⋮ Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features ⋮ CD GRAMMAR SYSTEMS WITH REGULAR START CONDITIONS ⋮ On the Computational Capacity of Parallel Communicating Finite Automata ⋮ Some New Modes of Competence-Based Derivations in CD Grammar Systems ⋮ A note on achieving low-level rationality from pure reactivity ⋮ TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS ⋮ Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems ⋮ On some derivation mechanisms and the complexity of their Szilard languages ⋮ ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS ⋮ Nonreturning PC grammar systems can be simulated by returning systems ⋮ Contextual array grammars and array P systems ⋮ An infinite hierarchy induced by depth synchronization ⋮ On the number of components for some parallel communicating grammar systems ⋮ A General Framework for Regulated Rewriting Based on the Applicability of Rules ⋮ CD Grammar Systems: Competence and Confidence ⋮ Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence ⋮ On the Expressive Power of Valences in Cooperating Distributed Grammar Systems ⋮ Generative Power of Eco-Colonies ⋮ Grammar systems: A grammatical approach to distribution and cooperation ⋮ Parallel communicating grammar systems with context-free components are Turing complete for any communication model ⋮ On the power of parallel communicating grammar systems with right-linear components ⋮ Using a graph grammar system in the finite element method ⋮ Small SNQ P systems with multiple types of spikes ⋮ Image Representation using Distributed Weighted Finite Automata ⋮ A note on cooperating distributed grammar systems working in combined modes ⋮ On the number of components in cooperating distributed grammar systems ⋮ On the size complexity of hybrid networks of evolutionary processors ⋮ VARIANTS OF COMPETENCE-BASED DERIVATIONS IN CD GRAMMAR SYSTEMS ⋮ Parallel communicating limited and uniformly limited 0L systems ⋮ Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization ⋮ Logical string rewriting ⋮ Left-forbidding cooperating distributed grammar systems ⋮ On the synchronized derivation depth of context-free grammars ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Returning and non-returning parallel communicating finite automata are equivalent ⋮ On the power of parallel communicating Watson-Crick automata systems ⋮ Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts ⋮ The component hierarchy of chain-free cooperating distributed regular tree grammars ⋮ On Restarting Automata with Window Size One ⋮ On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems ⋮ P Systems with String Objects and with Communication by Request ⋮ Unnamed Item ⋮ On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata ⋮ Reversible parallel communicating finite automata systems ⋮ ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA ⋮ PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS ⋮ POSITIONED AGENTS IN ECO-GRAMMAR SYSTEMS ⋮ ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS ⋮ Networks of Reaction Systems ⋮ Using Graph Grammar Systems with Memory in Computer Aided Design ⋮ Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules ⋮ DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS ⋮ ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS ⋮ On the intersection of regex languages with regular languages ⋮ 2-testability and relabelings produce everything ⋮ Team behaviour in eco-grammar systems ⋮ On simulating non-returning PC grammar systems with returning systems ⋮ Teams of pushdown automata ⋮ ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS ⋮ ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING ⋮ SC-EXPRESSIONS IN OBJECT-ORIENTED LANGUAGES ⋮ Decidability problems in grammar systems ⋮ Some results about centralized PC grammar systems ⋮ Colonies with limited activation of components ⋮ DNA computing based on splicing: Universality results ⋮ CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store ⋮ Computing with membranes ⋮ Globally deterministic CD-systems of stateless R-automata with window size 1 ⋮ P colonies and prescribed teams ⋮ Topics in the theory of DNA computing. ⋮ Stack cooperation in multistack pushdown automata ⋮ Prescribed teams of rules working on several objects ⋮ Fuzzy \(\omega\)-automata ⋮ Some undecidable problems for parallel communicating finite automata systems ⋮ Parallel communicating grammar systems with bounded resources ⋮ Unnamed Item ⋮ P colonies with agent division

This page was built for publication: