scientific article; zbMATH DE number 5271
From MaRDI portal
Publication:4712967
Recommendations
- Further remarks on parallel communicating grammar systems
- On the computational completeness of context-free parallel communicating grammar systems
- On the generative capacity of parallel communicating grammar systems
- On the generative capacity of parallel communicating grammar systems
- scientific article; zbMATH DE number 23841
Cited in
(32)- The impact of the number of cooperating grammars on the generative power
- On simulating non-returning PC grammar systems with returning systems
- On the computational completeness of context-free parallel communicating grammar systems
- Some hierarchies for the communication complexity measures of cooperating grammar systems
- Parallel grammars: A phenomenology
- Grouped partial ET0L systems and parallel multiple context-free grammars
- Parallel communicating grammar systems with bounded resources
- Computing a context-free grammar-generating series
- On centralized parallel communicating grammar systems with context-sensitive components
- Context-free grammars with linked nonterminals
- ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
- Further remarks on parallel communicating grammar systems
- REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS
- Parallel context-free string-token Petri nets
- Learning Subclasses of Parallel Communicating Grammar Systems
- Parallel Communicating Grammar Systems with Regular Control
- scientific article; zbMATH DE number 23841 (Why is no real title available?)
- scientific article; zbMATH DE number 97565 (Why is no real title available?)
- scientific article; zbMATH DE number 1244204 (Why is no real title available?)
- Probabilistic Parallel Communicating Grammar Systems
- Pattern Languages Versus Parallel Communicating Grammar Systems
- scientific article; zbMATH DE number 1951577 (Why is no real title available?)
- scientific article; zbMATH DE number 1502103 (Why is no real title available?)
- Limitations of coverability trees for context-free parallel communicating grammar systems and why these grammar systems are not linear space
- scientific article; zbMATH DE number 4121469 (Why is no real title available?)
- scientific article; zbMATH DE number 827988 (Why is no real title available?)
- scientific article; zbMATH DE number 907953 (Why is no real title available?)
- scientific article; zbMATH DE number 1406010 (Why is no real title available?)
- scientific article; zbMATH DE number 1406157 (Why is no real title available?)
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model
- Logical Aspects of Computational Linguistics
- On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms
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 Q4712967)