scientific article; zbMATH DE number 97565

MaRDI QIDQ4022014zbMATH OpenFDO

Authors Gheorghe Păun

Publication date 17 January 1993

Full work available at URL https://eudml.org/doc/28931, http://www.kybernetika.cz/content/1992/2/155

zbMATH Keywords

systems of grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1333610
• scientific article; zbMATH DE number 878943
• Further remarks on parallel communicating grammar systems
• Some hierarchies for the communication complexity measures of cooperating grammar systems
• scientific article; zbMATH DE number 8777

Cites work

• Concise description of finite languages
• scientific article; zbMATH DE number 4135414 (Why is no real title available?)
• scientific article; zbMATH DE number 8796 (Why is no real title available?)
• scientific article; zbMATH DE number 23841 (Why is no real title available?)
• scientific article; zbMATH DE number 5271 (Why is no real title available?)
• scientific article; zbMATH DE number 4119647 (Why is no real title available?)
• scientific article; zbMATH DE number 3254902 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Some classifications of context-free languages

Cited in

(24)

• The impact of the number of cooperating grammars on the generative power
• On the synchronization in parallel communicating grammar systems
• Some hierarchies for the communication complexity measures of cooperating grammar systems
• Parallel communicating grammar systems with bounded resources
• Searching for traces of communication in szilard languages of parallel communicating grammar systems -- complexity views
• On centralized parallel communicating grammar systems with context-sensitive components
• ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
• REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS
• scientific article; zbMATH DE number 5506908 (Why is no real title available?)
• scientific article; zbMATH DE number 4028931 (Why is no real title available?)
• scientific article; zbMATH DE number 4043269 (Why is no real title available?)
• scientific article; zbMATH DE number 1333610 (Why is no real title available?)
• scientific article; zbMATH DE number 1998334 (Why is no real title available?)
• scientific article; zbMATH DE number 1502103 (Why is no real title available?)
• 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
• Massively parallel fault tolerant computations on syntactical patterns
• scientific article; zbMATH DE number 827988 (Why is no real title available?)
• scientific article; zbMATH DE number 871242 (Why is no real title available?)
• scientific article; zbMATH DE number 878943 (Why is no real title available?)
• scientific article; zbMATH DE number 907952 (Why is no real title available?)
• scientific article; zbMATH DE number 907954 (Why is no real title available?)
• scientific article; zbMATH DE number 1406005 (Why is no real title available?)
• Two lower bounds on distributive generation of languages

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 Q4022014)