[{"file_date_updated":"2020-07-14T12:46:35Z","ec_funded":1,"publist_id":"7325","creator":{"login":"kschuh","id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},"author":[{"first_name":"Alex","last_name":"Kruckman"},{"id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","first_name":"Sasha"},{"first_name":"John","last_name":"Sheridan"},{"first_name":"Ben","last_name":"Zax"}],"date_created":"2018-12-11T11:46:47Z","dini_type":"doc-type:conferenceObject","date_updated":"2021-01-12T08:01:04Z","volume":96,"publication_status":"published","department":[{"tree":[{"_id":"ResearchGroups"},{"_id":"IST"}],"_id":"KrCh"}],"month":"10","conference":{"name":"GandALF: Games, Automata, Logics and Formal Verification","start_date":"2012-09-06","location":"Napoli, Italy","end_date":"2012-09-08"},"message":"Correct Creative Commons License: CC BY 3.0","language":[{}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng"}],"type":"conference","alternative_title":[],"pubrep_id":"944","file":[{"content_type":"application/pdf","file_size":97736,"creator":"system","file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:15:31Z","checksum":"56277f95edc9d531fa3bdc5f9579fda8","relation":"main_file","file_id":"5152"}],"oa_version":"Published Version","_id":"495","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":[],"status":"public","intvolume":" 96","day":"07","has_accepted_license":"1","uri_base":"https://research-explorer.ista.ac.at","dc":{"source":["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"],"rights":["info:eu-repo/semantics/openAccess"],"title":["A Myhill Nerode theorem for automata with advice","EPTCS"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.4204/EPTCS.96.18","info:eu-repo/grantAgreement/FWF//S 11407_N23","info:eu-repo/grantAgreement/EC/FP7/279307"],"subject":["ddc:004"],"publisher":["Open Publishing Association"],"date":["2012"],"language":["eng"],"type":["info:eu-repo/semantics/conferenceObject","doc-type:conferenceObject","text","http://purl.org/coar/resource_type/c_5794"],"identifier":["https://research-explorer.ista.ac.at/record/495","https://research-explorer.ista.ac.at/download/495/5152"],"description":["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."],"creator":["Kruckman, Alex","Rubin, Sasha","Sheridan, John","Zax, Ben"]},"scopus_import":1,"date_published":"2012-10-07T00:00:00Z","publication":"Proceedings GandALF 2012","citation":{"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.","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","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.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, 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.","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."},"page":"238 - 246"}]