Back to search

McMaster University

Restricted Parallelism and Regular Grammars

Abstract

dc:description.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>

Degree

thesis:*
Department dc:contributor.department
Mathematics
Year dc:date.issued
1972

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rosenbrugh, Robert D.
Advisor dc:contributor.advisor
  • Wood, Derick

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Rosenbrugh, Robert D.. Restricted Parallelism and Regular Grammars. 1972. http://hdl.handle.net/11375/20070