{"id":{"repo_id":"athens","oai_identifier":"oai:lib.uoa.gr:uoadl:1320944"},"canonical_url":"https://search.ndltd.org/etd/athens/oai:lib.uoa.gr:uoadl:1320944","repository":{"repo_id":"athens","name":"National and Kapodistrian University of Athens","base_url":"https://pergamos.lib.uoa.gr/uoa/dl/frontend/oaipmh"},"display":{"title":"Computability and complexity of two-way finite automata","abstract":"Υπολογισιμότητα πεπερασμένων αυτοματων μιας κεφαλής και ισοδυναμία αυτών. Κλάσεις πολυπλοκότητας αυτομάτων, πληρότητα, αναγωγές, σχέσεις με πολυπλοκότητα μηχανών τιούρινγκ. Αναζήτηση αναγωγής για την πληρότητα προβλημάτων με σταθερή είσοδο.","abstract_html":"Υπολογισιμότητα πεπερασμένων αυτοματων μιας κεφαλής και ισοδυναμία αυτών. Κλάσεις πολυπλοκότητας αυτομάτων, πληρότητα, αναγωγές, σχέσεις με πολυπλοκότητα μηχανών τιούρινγκ. Αναζήτηση αναγωγής για την πληρότητα προβλημάτων με σταθερή είσοδο.","abstract_has_math":false,"creators":["Μίσιος Αριστοτέλης"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-11-19T05:26:35Z","subjects":[],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["uoadl:1320944"],"render_values":[{"text":"uoadl:1320944","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://pergamos.lib.uoa.gr/uoa/dl/object/1320944","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://pergamos.lib.uoa.gr/uoa/dl/object/1320944","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://pergamos.lib.uoa.gr/uoa/dl/frontend/oaipmh?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Alib.uoa.gr%3Auoadl%3A1320944","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Μίσιος Αριστοτέλης"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013"]},{"key":"dc:type","label":"Dc Type","values":["born_digital_postgraduate_thesis","Διπλωματική Εργασία","Postgraduate Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["uoadl:1320944","https://pergamos.lib.uoa.gr/uoa/dl/object/1320944"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Υπολογισιμότητα πεπερασμένων αυτοματων μιας κεφαλής και ισοδυναμία αυτών. Κλάσεις πολυπλοκότητας αυτομάτων, πληρότητα, αναγωγές, σχέσεις με πολυπλοκότητα μηχανών τιούρινγκ. Αναζήτηση αναγωγής για την πληρότητα προβλημάτων με σταθερή είσοδο.","Computability of finite automata with one head, and computational equivalence. Complexity classes of those finite automata, complete problems, open problems, reductions, relations with turing machine complexity. Search for a reduction, to find a complete problem in classes with constant input. Counterexamples."]},{"key":"dc:title","label":"Title","values":["Computability and complexity of two-way finite automata"]}]}],"canonical_facts":{"dc:creator":["Μίσιος Αριστοτέλης"],"dc:date":["2013"],"dc:description":["Υπολογισιμότητα πεπερασμένων αυτοματων μιας κεφαλής και ισοδυναμία αυτών. Κλάσεις πολυπλοκότητας αυτομάτων, πληρότητα, αναγωγές, σχέσεις με πολυπλοκότητα μηχανών τιούρινγκ. Αναζήτηση αναγωγής για την πληρότητα προβλημάτων με σταθερή είσοδο.","Computability of finite automata with one head, and computational equivalence. Complexity classes of those finite automata, complete problems, open problems, reductions, relations with turing machine complexity. Search for a reduction, to find a complete problem in classes with constant input. Counterexamples."],"dc:identifier":["uoadl:1320944","https://pergamos.lib.uoa.gr/uoa/dl/object/1320944"],"dc:language":["English"],"dc:title":["Computability and complexity of two-way finite automata"],"dc:type":["born_digital_postgraduate_thesis","Διπλωματική Εργασία","Postgraduate Thesis"]},"updated_at":"2026-11-19T05:26:35Z"}