{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/20070"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/20070","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Rosenbrugh, Robert D."],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Wood, Derick"],"committee_chairs":[],"committee_members":[],"year":1972,"date_issued":"1972-11","date_published":"1972-11","updated_at":"2026-11-18T19:33:28Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/14164"],"render_values":[{"text":"https://doi.org/10.71548/14164","href":"https://doi.org/10.71548/14164","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/20070","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/20070","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F20070","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Wood, Derick"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Rosenbrugh, Robert D."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-08-08T15:43:38Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-08-08T15:43:38Z"]},{"key":"dc:date.issued","label":"Date","values":["1972-11"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/20070","https://doi.org/10.71548/14164"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title: Restricted Parallelism and Regular Grammars, Author: Robert D. Rosebrugh, Location: Thode"]},{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MS)"]},{"key":"dc:title","label":"Title","values":["Restricted Parallelism and Regular Grammars"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Wood, Derick"],"dc:contributor.department":["Mathematics"],"dc:creator":["Rosenbrugh, Robert D."],"dc:date.accessioned":["2016-08-08T15:43:38Z"],"dc:date.available":["2016-08-08T15:43:38Z"],"dc:date.issued":["1972-11"],"dc:description":["Title: Restricted Parallelism and Regular Grammars, Author: Robert D. Rosebrugh, Location: Thode"],"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>"],"dc:description.degree":["Master of Science (MS)"],"dc:identifier.uri":["http://hdl.handle.net/11375/20070","https://doi.org/10.71548/14164"],"dc:language.iso":["en"],"dc:title":["Restricted Parallelism and Regular Grammars"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:33:28Z"}