作者: Jürgen Dassow
关键词:
摘要: Networks of parallel language processors form a special type grammar systems where derivation steps in the mode L and communication alternate. We prove that, given an arbitrary system, equivalent system with at most three components can be constructed. This improves result [2]. Furthermore we consider function f(m) which gives number words generated m steps. relate this to growth functions D0L undecidability equivalence respect function.