scientific article; zbMATH DE number 5271

MaRDI QIDQ4712967zbMATH OpenFDO

Authors Gheorghe Păun

Publication date 25 June 1992

zbMATH Keywords

context-free languagegenerative capacityparallel communicating grammar systemsgrammatical model of parallel computing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

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

(29)

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

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)