scientific article; zbMATH DE number 745858
From MaRDI portal
Publication:4763798
Cited in
(only showing first 100 items - show all)- 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
- Decidability problems in grammar systems
- Some results about centralized PC grammar systems
- Stack cooperation in multistack pushdown automata
- Cooperation in context-free grammars
- Tissue P systems.
- Colonies with limited activation of components
- DNA computing based on splicing: Universality results
- Computing with membranes
- Fuzzy -automata
- Some undecidable problems for parallel communicating finite automata systems
- Parallel communicating grammar systems with bounded resources
- On the number of components in cooperating distributed grammar systems
- On the size complexity of hybrid networks of evolutionary processors
- Topics in the theory of DNA computing.
- 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.
- Small SNQ P systems with multiple types of spikes
- Reversible parallel communicating finite automata systems
- Prescribed teams of rules working on several objects
- On the synchronized derivation depth of context-free grammars
- Lower bound technique for length-reducing automata
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- On the classes of languages characterized by generalized P colony automata
- On some derivation mechanisms and the complexity of their Szilard languages
- An infinite hierarchy induced by depth synchronization
- On the number of components for some parallel communicating grammar systems
- On the power of parallel communicating Watson-Crick automata systems
- Using graph grammar systems with memory in computer aided design
- Globally deterministic CD-systems of stateless R-automata with window size 1
- On a hierarchy of languages generated by cooperating distributed grammar systems
- Array-rewriting P systems with basic puzzle grammar rules and permitting features
- 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
- PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS
- Positioned agents in eco-grammar systems
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- Positioned agents in eco-grammar systems with border markers and pure regulated grammars
- 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 METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
- On competence in CD grammar systems with parallel rewriting
- SC-expressions in object-oriented languages
- P colonies and prescribed teams
- 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
- TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS
- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
- Multigenerative grammar systems and matrix grammars
- Variants of competence-based derivations in CD grammar systems
- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
- ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
- 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 power of permitting features in cooperating context-free array grammar systems
- Probabilistic Parallel Communicating Grammar Systems
- On the power of parallel communicating grammar systems with right-linear components
- On CD-systems of stateless deterministic R-automata with window size one
- Teams of pushdown automata
- Grammar systems: a grammatical approach to distribution and cooperation
- Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts
- A note on achieving low-level rationality from pure reactivity
- Image representation using distributed weighted finite automata
- General CD grammar systems and their simplification
- Contextual array grammars and array P systems
- CD grammar systems with two propagating scattered context components characterize the family of context sensitive languages
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model
- On hierarchy of the positioned eco-grammar systems
- On restarting automata with window size one
- On the number of components and clusters of non-returning parallel communicating grammar systems
- Networks of reaction systems
- CD grammar systems with competence based entry conditions in their cooperation protocols
- Using a graph grammar system in the finite element method
- Returning and non-returning parallel communicating finite automata are equivalent
- P Systems with String Objects and with Communication by Request
- ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
- ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS
- Regulated insertion-deletion systems
- Parallel communicating limited and uniformly limited 0L systems
- Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
- Logical string rewriting
- The component hierarchy of chain-free cooperating distributed regular tree grammars
- CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
- P colonies with agent division
- About reversibility in sP colonies and reaction systems
- A survey on automata with translucent letters
- Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
- Nonreturning PC grammar systems can be simulated by returning systems
- Variants of tissue P systems with prescribed teams of channel rules
- Unconventional computational models for distributed networks: results and perspectives
- Parallel accepting colonies: computational power and deterministic parsing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763798)
