{"day":"07","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Open Publishing Association","year":"2012","ec_funded":1,"date_published":"2012-10-07T00:00:00Z","scopus_import":1,"quality_controlled":"1","title":"A Myhill Nerode theorem for automata with advice","oa_version":"Published Version","publist_id":"7325","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","date_created":"2018-12-12T10:15:31Z","checksum":"56277f95edc9d531fa3bdc5f9579fda8","file_id":"5152","creator":"system","date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_size":97736}],"pubrep_id":"944","intvolume":"        96","status":"public","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"page":"238 - 246","oa":1,"file_date_updated":"2020-07-14T12:46:35Z","ddc":["004"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"month":"10","date_created":"2018-12-11T11:46:47Z","citation":{"ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association; 2012:238-246. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>","mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012, vol. 96, pp. 238–246.","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.","chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46. Open Publishing Association, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>.","apa":"Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>"},"alternative_title":["EPTCS"],"_id":"495","author":[{"last_name":"Kruckman","first_name":"Alex","full_name":"Kruckman, Alex"},{"last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","full_name":"Rubin, Sasha"},{"last_name":"Sheridan","full_name":"Sheridan, John","first_name":"John"},{"last_name":"Zax","full_name":"Zax, Ben","first_name":"Ben"}],"doi":"10.4204/EPTCS.96.18","conference":{"start_date":"2012-09-06","end_date":"2012-09-08","location":"Napoli, Italy","name":"GandALF: Games, Automata, Logics and Formal Verification"},"abstract":[{"lang":"eng","text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice."}],"publication_status":"published","publication":"Proceedings GandALF 2012","has_accepted_license":"1","type":"conference","date_updated":"2021-01-12T08:01:04Z","volume":96}