scientific article
From MaRDI portal
Publication:3982094
zbMath0749.68048MaRDI QIDQ3982094
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Mathematical problems of computer architecture (68M07) Grammars and rewriting systems (68Q42)
Related Items
Some hierarchies for the communication complexity measures of cooperating grammar systems ⋮ PC grammar systems with five context-free components generate all recursively enumerable languages. ⋮ Two lower bounds on distributive generation of languages ⋮ Parallel communicating grammar systems with regular control and skeleton preserving FRR automata ⋮ Cooperating grammars' systems: Power and parameters ⋮ Nonreturning PC grammar systems can be simulated by returning systems ⋮ Grammar systems: A grammatical approach to distribution and cooperation ⋮ The impact of the number of cooperating grammars on the generative power ⋮ On the power of parallel communicating grammar systems with right-linear components ⋮ Accepting networks of evolutionary processors with subregular filters ⋮ Complexity-preserving simulations among three variants of accepting networks of evolutionary processors ⋮ Parallel communicating limited and uniformly limited 0L systems ⋮ On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms ⋮ Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts ⋮ On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems ⋮ Unnamed Item ⋮ 2-testability and relabelings produce everything ⋮ On simulating non-returning PC grammar systems with returning systems ⋮ On the computational power of context-free PC grammar systems ⋮ Decidability problems in grammar systems ⋮ Some results about centralized PC grammar systems ⋮ On the computational completeness of context-free parallel communicating grammar systems ⋮ Computing with membranes ⋮ Parallel communicating grammar systems with bounded resources ⋮ Networks of evolutionary processors: computationally complete normal forms
This page was built for publication:
