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