Dassow, Jürgen; Kelemen, Jozef; Păun, Gheorghe On parallelism in colonies. (English) Zbl 0795.68121 Cybern. Syst. 24, No. 1, 37-49 (1993). Summary: Colonies (basically, grammar systems with the components generating finite languages) with parallel activity (all the components that can work must work) in two variants are defined here and their generative capacity is investigated. It is found that the (strong) parallelism increases the power of colonies, but subfamilies of matrix languages are obtained. Cited in 8 Documents MSC: 68Q42 Grammars and rewriting systems Keywords:colonies; parallelism; matrix languages PDFBibTeX XMLCite \textit{J. Dassow} et al., Cybern. Syst. 24, No. 1, 37--49 (1993; Zbl 0795.68121) Full Text: DOI References: [1] DOI: 10.1016/S0921-8890(05)80025-9 · doi:10.1016/S0921-8890(05)80025-9 [2] DOI: 10.1016/0004-3702(91)90053-M · doi:10.1016/0004-3702(91)90053-M [3] Brooks , R. A. 1991 b . Intelligence Without Reason (A.I. Memo No. 1293) . MIT AI Laboratory , Cambridge , MA . [4] Connell , J. 1989 . A Colony Architecture for an Artificial Creature (Technical Report TR-1151) . MIT AI Laboratory , Cambridge , MA . [5] Csuhaj-Varjú E., J. Inform. Process. Cybernet. 26 pp 49– (1990) [6] Dassow J., J. Inform. Process. Cybernet. 24 pp 287– (1988) [7] Dassow J., Regulated Rewriting in Formal Language Theory (1989) [8] DOI: 10.1080/01969729208927485 · Zbl 0782.68072 · doi:10.1080/01969729208927485 [9] Paun Gh., Ann. Univ. Buc. Sen Matem.-Inform. 38 pp 55– (1989) [10] DOI: 10.1145/321495.321504 · Zbl 0182.02004 · doi:10.1145/321495.321504 [11] Salomaa A., Formal Languages (1973) [12] Wätjen D., J. Inform. Process. Cybernet. 24 pp 267– (1988) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.