{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:04:07Z","timestamp":1743019447909,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030657284"},{"type":"electronic","value":"9783030657291"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65729-1_10","type":"book-chapter","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T16:03:13Z","timestamp":1608652993000},"page":"110-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polyhedra of Finite State Machines and Their Use in the Identification Problem"],"prefix":"10.1007","author":[{"given":"Sergey Yu.","family":"Melnikov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6368-9680","authenticated-orcid":false,"given":"Konstantin E.","family":"Samouylov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,22]]},"reference":[{"issue":"1968","key":"10_CR1","first-page":"5","volume":"61","author":"G Marsaglia","year":"1968","unstructured":"Marsaglia, G.: Random numbers fall mainly in the planes. Proc. Natl. Acad. Sci. 61(1968), 5\u201328 (1968)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10_CR2","unstructured":"Haramoto, H., Matsumoto, M.: Again, random numbers fall mainly in the planes: xorshift128+, arxiv.org\/abs\/1908.10020. Accessed 30 Jun 2020"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Tverdokhlebov, V.A.: Geometrical approach to technical diagnosing of automatons. In: Proceedings of the IEEE East-West Design & Test Symposium, EWDTS 2011, National University of Radioelectronics, Kharkov, pp. 240\u2013243 (2011)","DOI":"10.1109\/EWDTS.2011.6116589"},{"issue":"5\u20136","key":"10_CR4","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1134\/S0001434612050033","volume":"91","author":"AV Babash","year":"2012","unstructured":"Babash, A.V.: Automaton barriers. Math. Notes 91(5\u20136), 625\u2013629 (2012)","journal-title":"Math. Notes"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1515\/dma-2014-0019","volume":"24","author":"DV Parkhomenko","year":"2014","unstructured":"Parkhomenko, D.V.: Automata generated p-languages. Discrete Math. Appl. 24(4), 207\u2013212 (2014)","journal-title":"Discrete Math. Appl."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-15375-4_19","volume-title":"CONCUR 2010 - Concurrency Theory","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T.A., Rannou, P.: Mean-payoff automaton expressions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 269\u2013283. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_19"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1515\/dma.2011.016","volume":"21","author":"AA Grusho","year":"2011","unstructured":"Grusho, A.A., Timonina, E.E.: Prohibitions in discrete probabilistic statistical problems. Discrete Math. Appl. 21(3), 275\u2013281 (2011)","journal-title":"Discrete Math. Appl."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gerasimenko, M., Petrov, V., Galinina, O., Andreev, S., Koucheryavy, Y.: Energy and delay analysis of LTE-Advanced RACH performance under MTC overload. In: 2012 IEEE Globecom Workshops, GC Wkshps 2012, pp. 1632\u20131637 (2012). Art. no. 6477830","DOI":"10.1109\/GLOCOMW.2012.6477830"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Pyattaev, A., Johnsson, K., Surak, A., Florea, R., Andreev, S., Koucheryavy, Y.: Network-assisted D2D communications: implementing a technology prototype for cellular traffic offloading. In: IEEE Wireless Communications and Networking Conference, WCNC, pp. 3266\u20133271 (2014). Art. no. 6953070","DOI":"10.1109\/WCNC.2014.6953070"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/MWC.2016.7553033","volume":"23","author":"A Ometov","year":"2016","unstructured":"Ometov, A., et al.: Toward trusted, social-aware D2D connectivity: bridging across the technology and sociality realms. IEEE Wirel. Commun. 23(4), 103\u2013111 (2016). Art. no. 7553033","journal-title":"IEEE Wirel. Commun."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-88162-6_6","volume-title":"Selecta Mathematica II Heidelberger Taschenb\u00fccher","author":"K Jacobs","year":"1970","unstructured":"Jacobs, K.: Turing-Maschinen und zuf\u00e4llige 0\u20131-Folgen. In: Jacobs, K. (ed.) Selecta Mathematica II Heidelberger Taschenb\u00fccher, vol. 67, pp. 141\u2013167. Springer, Heidelberg (1970). https:\/\/doi.org\/10.1007\/978-3-642-88162-6_6"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"key":"10_CR13","unstructured":"Liu, H., Wang, J.: A new way to enumerate cycles in graph. In: Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT-ICIW 2006, Washington, DC, USA, pp. 57\u201359 (2006)"},{"key":"10_CR14","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry - An Introduction","author":"FP Preparata","year":"1988","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Monographs in Computer Science. Springer, New York (1988). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Skala, V.: Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision. In: ICNAAM 2015, pp. 22\u201328. AIP Publishing LLC. (2015)","DOI":"10.1063\/1.4952270"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65729-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:38:09Z","timestamp":1710250689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65729-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030657284","9783030657291"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65729-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NEW2AN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Next Generation Wired\/Wireless Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.new2an.org\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"225","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}