{"id":{"repo_id":"gatech","oai_identifier":"oai:repository.gatech.edu:1853/8167"},"canonical_url":"https://search.ndltd.org/etd/gatech/oai:repository.gatech.edu:1853/8167","repository":{"repo_id":"gatech","name":"Georgia Tech","base_url":"https://repository.gatech.edu/server/oai/request"},"display":{"title":"Some results on systolic tree automata as acceptors","abstract":"M.S.","abstract_html":"M.S.","abstract_has_math":false,"creators":["Foufa, Aouaouche Fazileit"],"institution":"Georgia Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Information Science","school":null,"contributors":[],"advisors":["King, K. N."],"committee_chairs":[],"committee_members":[],"year":1985,"date_issued":"1985","date_published":"1985","updated_at":"2026-11-19T04:26:16Z","subjects":["Sequential machine theory","Formal languages"],"languages":["en_US"],"rights":["Access restricted to authorized Georgia Tech users only."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["291037"],"render_values":[{"text":"291037","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1853/8167","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/1853/8167","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://repository.gatech.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Arepository.gatech.edu%3A1853%2F8167","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["King, K. N."]},{"key":"dc:contributor.department","label":"Department","values":["Information Science"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["College of Computing"]},{"key":"dc:creator","label":"Author","values":["Foufa, Aouaouche Fazileit"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2006-03-10T19:22:52Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2006-03-10T19:22:52Z"]},{"key":"dc:date.issued","label":"Date","values":["1985"]},{"key":"dc:publisher","label":"Institution","values":["Georgia Institute of Technology"]},{"key":"dc:relation.orgunit","label":"Dc Relation Orgunit","values":["c8892b3c-8db6-4b7b-a33a-1b67f7db2021"]},{"key":"dc:type","label":"Dc Type","values":["Text","Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject.lcsh","label":"Dc Subject Lcsh","values":["Sequential machine theory","Formal languages"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Access restricted to authorized Georgia Tech users only."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["291037"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1853/8167"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.S."]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["241 bytes"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["text/html"]},{"key":"dc:title","label":"Title","values":["Some results on systolic tree automata as acceptors"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]}]}],"canonical_facts":{"dc:contributor.advisor":["King, K. N."],"dc:contributor.department":["Information Science"],"dc:contributor.other":["College of Computing"],"dc:creator":["Foufa, Aouaouche Fazileit"],"dc:date.accessioned":["2006-03-10T19:22:52Z"],"dc:date.available":["2006-03-10T19:22:52Z"],"dc:date.issued":["1985"],"dc:description.degree":["M.S."],"dc:format.extent":["241 bytes"],"dc:format.mimetype":["text/html"],"dc:identifier.bibid":["291037"],"dc:identifier.uri":["http://hdl.handle.net/1853/8167"],"dc:language.iso":["en_US"],"dc:publisher":["Georgia Institute of Technology"],"dc:relation.orgunit":["c8892b3c-8db6-4b7b-a33a-1b67f7db2021"],"dc:rights":["Access restricted to authorized Georgia Tech users only."],"dc:subject.lcsh":["Sequential machine theory","Formal languages"],"dc:title":["Some results on systolic tree automata as acceptors"],"dc:type":["Text","Thesis"],"dspace:entity.type":["Publication"]},"updated_at":"2026-11-19T04:26:16Z"}