Buchholz, ThomasThomasBuchholzKlein, AndreasAndreasKleinKutrib, MartinMartinKutrib2022-09-121999-02-282022-09-121999http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-1394https://jlupub.ub.uni-giessen.de/handle/jlupub/7555http://dx.doi.org/10.22029/jlupub-6989Iterative arrays with restricted nondeterminism are investigated. Non-determinism is provided for the distinguished communication cell only. All the other cells are deterministic ones. Moreover, the number of allowed nondeterministic state transitions is limited dependent on the length of the input. It is shown that the limit can be reduced by a constant factor without affecting the language accepting capabilities, but for sublogarithmic limits there exists a infinite hierarchy of properly included realtime language families. Finally we prove several closure properties of these families.enIn Copyrightddc:004Iterative arrays with limited nondeterministic communication cell