{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:33Z","timestamp":1750308633760,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Russian Ministry of Science and Higher Education","award":["2.8866.2017\/8.9"],"award-info":[{"award-number":["2.8866.2017\/8.9"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,25]]},"DOI":"10.1145\/3310986.3311032","type":"proceedings-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:12:51Z","timestamp":1556626371000},"page":"81-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Exploring the Relationship between the Structural and the Actual Similarities of Automata"],"prefix":"10.1145","author":[{"given":"Petr","family":"Grachev","sequence":"first","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Bezborodov","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Smetannikov","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Filchenkov","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322334"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1134\/S1064230715050044"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.649"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2598394.2598446"},{"key":"e_1_3_2_1_6_1","volume-title":"International Joint Conference on Neural Networks","author":"Giles C. L.","year":"1991","unstructured":"Giles , C. L. , Chen , D. , Miller , C.B. , Chen , H.H. , Sun , G.Z. , and Lee , Y.C . 1991. Second-order recurrent neural networks for grammatical inference . In International Joint Conference on Neural Networks ( Seattle, WA, USA, July 8--12 , 1991 ). IEEE, 273--281 Giles, C. L., Chen, D., Miller, C.B., Chen, H.H., Sun, G.Z., and Lee, Y.C. 1991. Second-order recurrent neural networks for grammatical inference. In International Joint Conference on Neural Networks (Seattle, WA, USA, July 8--12, 1991). IEEE, 273--281"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Gold E.M 1978. Complexity of automaton identification from given data. Information and control 37 3 302--320  Gold E.M 1978. Complexity of automaton identification from given data. Information and control 37 3 302--320","DOI":"10.1016\/S0019-9958(78)90562-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gold E.M. 1967. Language identification in the limit. Information and control 10 5 447--474  Gold E.M. 1967. Language identification in the limit. Information and control 10 5 447--474","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.11.162"},{"key":"e_1_3_2_1_10_1","unstructured":"Gribkoff E. 2013. Applications of Deterministic Finite Automata. ECS 120 UC Davis  Gribkoff E. 2013. Applications of Deterministic Finite Automata. ECS 120 UC Davis"},{"volume-title":"Grammatical inference: Learning Automata and Grammars","author":"Higuera C.","key":"e_1_3_2_1_11_1","unstructured":"Higuera . C. , 2010. Grammatical inference: Learning Automata and Grammars . Cambridge University Press Higuera. C., 2010. Grammatical inference: Learning Automata and Grammars. Cambridge University Press"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_34"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.6.1155"},{"key":"e_1_3_2_1_14_1","volume-title":"Regular Inference on Artificial Neural Networks. In International Cross-Domain Conference for Machine Learning and Knowledge Extraction","author":"Mayr F.","year":"2018","unstructured":"Mayr , F. , and Yovine , S . 2018 . Regular Inference on Artificial Neural Networks. In International Cross-Domain Conference for Machine Learning and Knowledge Extraction ( Hamburg, Germany, August 27--30 , 2018 ). Springer, 350--369 Mayr, F., and Yovine, S. 2018. Regular Inference on Artificial Neural Networks. In International Cross-Domain Conference for Machine Learning and Knowledge Extraction (Hamburg, Germany, August 27--30, 2018). Springer, 350--369"},{"volume-title":"Elements of automata theory","author":"Sakarovitch J.","key":"e_1_3_2_1_15_1","unstructured":"Sakarovitch , J. 2009. Elements of automata theory . Cambridge University Press Sakarovitch, J. 2009. Elements of automata theory. Cambridge University Press"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2011.166"},{"key":"e_1_3_2_1_17_1","volume-title":"International Conference on Language and Automata Theory and Applications, 2015","author":"Ulyantsev V.","year":"2015","unstructured":"Ulyantsev , V. , Zakirzyanov , I. , and Shalyto , A ., 2015. BFS-based symmetry breaking predicates for DFA identification . In International Conference on Language and Automata Theory and Applications, 2015 (Nice, France, March 2--6 , 2015 ). Springer, 611--622 Ulyantsev, V., Zakirzyanov, I., and Shalyto, A., 2015. BFS-based symmetry breaking predicates for DFA identification. In International Conference on Language and Automata Theory and Applications, 2015 (Nice, France, March 2--6, 2015). Springer, 611--622"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_19_1","volume-title":"E.","author":"Weiss G.","year":"2017","unstructured":"Weiss , G. , and Goldberg , Y. , and Yahav , E. 2017 . Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples . arXiv preprint arXiv:1711.09576 Weiss, G., and Goldberg, Y., and Yahav, E. 2017. Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples. arXiv preprint arXiv:1711.09576"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1993.298535"}],"event":{"name":"ICMLSC 2019: 2019 the 3rd International Conference on Machine Learning and Soft Computing","acronym":"ICMLSC 2019","location":"Da Lat Viet Nam"},"container-title":["Proceedings of the 3rd International Conference on Machine Learning and Soft Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3310986.3311032","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3310986.3311032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:08:01Z","timestamp":1750273681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3310986.3311032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,25]]},"references-count":20,"alternative-id":["10.1145\/3310986.3311032","10.1145\/3310986"],"URL":"https:\/\/doi.org\/10.1145\/3310986.3311032","relation":{},"subject":[],"published":{"date-parts":[[2019,1,25]]},"assertion":[{"value":"2019-01-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}