Restricted Parallelism and Regular Grammars

Abstract

<p>This thesis studies the properties of k-parallel right-linear languages. An infinite hierarchy of language families is found and closure properties of these families are studied. The language families are characterised in terms of simple languages and non-deterministic generalised sequential machine mappings. In addition a characterisation of k-right-linear simple matrix languages by k-parallel right-linear languages with a control device is given.</p>