{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:32:42Z","timestamp":1774542762597,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,12,8]]},"DOI":"10.1145\/3638584.3638588","type":"proceedings-article","created":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T11:15:19Z","timestamp":1710414919000},"page":"486-494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Study of All Semilattices on the Set of Covering Automata for the Waterloo Automaton"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2802-6144","authenticated-orcid":false,"given":"Mikhail E.","family":"Abramyan","sequence":"first","affiliation":[{"name":"Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China and \rVorovich Institute of Mathematics, Mechanics and Computer Science, Southern Federal University, Russian Federation"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6765-6800","authenticated-orcid":false,"given":"Boris F.","family":"Melnikov","sequence":"additional","affiliation":[{"name":"Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China"}]}],"member":"320","published-online":{"date-parts":[[2024,3,14]]},"reference":[{"issue":"4","key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Semilattices of the subsets of potential roots in the problems of the formal languages theory. Part I. Extracting the root from the language","volume":"10","author":"Melnikov B. F.","year":"2022","unstructured":"B. F. Melnikov. 2022. \u201cSemilattices of the subsets of potential roots in the problems of the formal languages theory. Part I. Extracting the root from the language.\u201d International Journal of Open Information Technologies, 10(4): 1\u20139 (in Russian).","journal-title":"International Journal of Open Information Technologies"},{"issue":"5","key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Semilattices of the subsets of potential roots in the problems of the formal languages theory. Part II. Constructing an inverse morphism","volume":"10","author":"Melnikov B. F.","year":"2022","unstructured":"B. F. Melnikov. 2022. \u201cSemilattices of the subsets of potential roots in the problems of the formal languages theory. Part II. Constructing an inverse morphism.\u201d International Journal of Open Information Technologies, 10(5): 1\u20138 (in Russian).","journal-title":"International Journal of Open Information Technologies"},{"issue":"7","key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Semilattices of the subsets of potential roots in the problems of the formal languages theory. Part III. The condition for the existence of a lattice","volume":"10","author":"Melnikov B. F.","year":"2022","unstructured":"B. F. Melnikov. 2022. \u201cSemilattices of the subsets of potential roots in the problems of the formal languages theory. Part III. The condition for the existence of a lattice.\u201d International Journal of Open Information Technologies, 10(7): 1\u20139 (in Russian).","journal-title":"International Journal of Open Information Technologies"},{"key":"e_1_3_2_1_4_1","volume-title":"The mathematical theory of context-free languages. Mir Publ","author":"Ginsburg S.","unstructured":"S. Ginsburg. 1973. The mathematical theory of context-free languages. Mir Publ., Moscow, 301 pages (in Russian)."},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction in the Finite Automata Theory. Radio I Svyaz Publ","author":"Brauer W.","unstructured":"W. Brauer. 1987. Introduction in the Finite Automata Theory. Radio I Svyaz Publ., Moscow, 390 pages (in Russian)."},{"key":"e_1_3_2_1_6_1","volume-title":"Regular languages and nondeterministic finite automata. RGSU Publ","author":"Melnikov B.","unstructured":"B. Melnikov. 2018. Regular languages and nondeterministic finite automata. RGSU Publ., Moscow, 179 pages (in Russian)."},{"key":"e_1_3_2_1_7_1","first-page":"95","article-title":"The loops of the basis finite automaton and the connected questions.\u201d Bulletin of the Voronezh State University","volume":"4","author":"Dolgov V.","year":"2016","unstructured":"V. Dolgov, B. Melnikov, A. Melnikova. 2016. \u201cThe loops of the basis finite automaton and the connected questions.\u201d Bulletin of the Voronezh State University. Series: Physics. Mathematics, 4: 95\u2013111 (in\u00a0Russian).","journal-title":"Series: Physics. Mathematics"},{"key":"e_1_3_2_1_8_1","first-page":"78","article-title":"Construction of universal finite automaton. II. Examples of algorithms functioning.\u201d Bulletin of the Voronezh State University","volume":"1","author":"Dolgov V.","year":"2014","unstructured":"V. Dolgov, B. Melnikov. 2014. \u201cConstruction of universal finite automaton. II. Examples of algorithms functioning.\u201d Bulletin of the Voronezh State University. Series: Physics. Mathematics, 1: 78\u201385 (in\u00a0Russian).","journal-title":"Series: Physics. Mathematics"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02941980"},{"issue":"7","key":"e_1_3_2_1_10_1","first-page":"69","article-title":"Semilattice graphs, matrix representations of idempotent semigroups and Waterloo automaton semilattices","volume":"11","author":"Zyablitceva L. V.","year":"2023","unstructured":"L. V. Zyablitceva, S. Yu. Korabelshchikova, M. E. Abramyan. 2023. \u201cSemilattice graphs, matrix representations of idempotent semigroups and Waterloo automaton semilattices.\u201d International Journal of Open Information Technologies, 11(7): 69\u201376 (in Russian).","journal-title":"International Journal of Open Information Technologies"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4236\/jampp.2023.115095"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.21685\/2072-3040-2021-2-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222994"}],"event":{"name":"CSAI 2023: 2023 7th International Conference on Computer Science and Artificial Intelligence","location":"Beijing China","acronym":"CSAI 2023"},"container-title":["Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638584.3638588","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638584.3638588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T14:55:31Z","timestamp":1755874531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638584.3638588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,8]]},"references-count":13,"alternative-id":["10.1145\/3638584.3638588","10.1145\/3638584"],"URL":"https:\/\/doi.org\/10.1145\/3638584.3638588","relation":{},"subject":[],"published":{"date-parts":[[2023,12,8]]},"assertion":[{"value":"2024-03-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}