Parallel communicating grammar systems: the context-sensitive case

DOI10.1080/00207169308804225zbMath0807.68063OpenAlexW1976473057MaRDI QIDQ4297199

Cecilia Magdalena Ionescu, Octavian Procopiuc, Ferucio Laurenţiu Ţiplea

Publication date: 3 July 1994

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804225

zbMATH Keywords

parallel communicating grammar systemcircularity problem

Mathematics Subject Classification ID

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

Related Items (3)

Some decision problems for parallel communicating grammar systems ⋮ Nonreturning PC grammar systems can be simulated by returning systems ⋮ Grammar systems: A grammatical approach to distribution and cooperation

Cites Work

• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Further remarks on parallel communicating grammar systems
• On the generative capacity of parallel communicating grammar systems

This page was built for publication: Parallel communicating grammar systems: the context-sensitive case