Parallel communication grammar systems: The regular case. (English) Zbl 0749.68048

A parallel communicating grammar system consists of \(n\) separated usual Chomsky grammars working simultaneously and sending messages (strings) to one of these grammars (a master); the terminal strings generated by the master grammar constitute the generated language.
This grammatical model for parallel computers, is investigated for the case that all grammars are regular.
Reviewer: L.Olaru (Iaşi)


68Q45 Formal languages and automata
68Q42 Grammars and rewriting systems
68M07 Mathematical problems of computer architecture