{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:58Z","timestamp":1740169318970,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004681","name":"Higher Education Commission of Pakistan","doi-asserted-by":"publisher","award":["9223\/Federal\/NRPU\/RD\/HEC\/2017"],"award-info":[{"award-number":["9223\/Federal\/NRPU\/RD\/HEC\/2017"]}],"id":[{"id":"10.13039\/501100004681","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3242124","type":"journal-article","created":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T18:55:19Z","timestamp":1675450519000},"page":"12525-12535","source":"Crossref","is-referenced-by-count":0,"title":["A Reinforcement Learning Based Grammatical Inference Algorithm Using Block-Based Delta Inverse Strategy"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3538-2622","authenticated-orcid":false,"given":"Farah","family":"Haneef","sequence":"first","affiliation":[{"name":"Department of Computer Science, Quaid-i-Azam University, Islamabad, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3411-9224","authenticated-orcid":false,"given":"Muddassar Azam","family":"Sindhu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Quaid-i-Azam University, Islamabad, Pakistan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9486-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57288-8_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(81)90090-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.11.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24486-0_8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116828"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037351"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11872436_23"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979326091X"},{"key":"ref12","first-page":"69","article-title":"Integrating grammatical inference into robotic planning","volume-title":"Proc. 7th Int. Conf. Grammatical Inference","volume":"21","author":"Chandlee"},{"key":"ref13","first-page":"1","article-title":"A semantics based verification tool for finite state systems","volume-title":"Proc. 9th IFIP Symp. Protocol Specification, Test. Verification","author":"Cleaveland"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52148-8_3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52148-8_3"},{"key":"ref16","first-page":"99","article-title":"Identifying regular languages in polynomial","volume-title":"Advances in Structural and Syntactic Pattern Recognition","volume":"5","author":"Departarnento","year":"1992"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0033357"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41707-8_11"},{"issue":"5","key":"ref19","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inf. Control"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45923-5_6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.51.4.31394"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48395-4_3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2017.01.016"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3243127.3243129"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88009-7_10"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-019-01369-6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54577-5_12"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-020-00387-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21768-5_11"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66583-2_9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103710"},{"key":"ref33","first-page":"1","article-title":"A polynomial time incremental algorithm for regular grammar inference","volume-title":"Proc. 4th Int. Colloq. Grammatical Inference (ICGI) (LNAI)","author":"Parekh"},{"key":"ref34","first-page":"1","article-title":"Verifying a CSMA\/CD-protocol with CCS","volume-title":"Proc. 7th IFIP Symp. Protocol Specification, Test. Verification","author":"Parrow"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-018-9429-3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-017-9399-x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1491"},{"key":"ref38","article-title":"IDS: An incremental learning algorithm for finite automata","author":"Sindhu","year":"2012","journal-title":"arXiv:1206.2691"},{"key":"ref39","first-page":"167","article-title":"Bigger is not always better: On the quality of hypotheses in active automata learning","volume-title":"Proc. 12th Int. Conf. Grammatical Inference","author":"Smetsers"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.12.015"},{"volume-title":"Introduction to Automata Theory, Languages and Computation","year":"1979","author":"Hopcroft","key":"ref41"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2967606"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45234-9_16"},{"article-title":"Analysing mutual exclusion algorithms using CCS","year":"1988","author":"Walker","key":"ref44"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2465449.2465469"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10036086.pdf?arnumber=10036086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T13:24:03Z","timestamp":1707830643000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10036086\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3242124","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}