{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:52:12Z","timestamp":1730281932568,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,13]]},"DOI":"10.1109\/memocode57689.2022.9954382","type":"proceedings-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T20:22:51Z","timestamp":1669666971000},"page":"1-11","source":"Crossref","is-referenced-by-count":0,"title":["A Reinforcement-Learning Style Algorithm for Black Box Automata"],"prefix":"10.1109","author":[{"given":"Itay","family":"Cohen","sequence":"first","affiliation":[{"name":"Bar Ilan University,Department of Computer Science,Ramat Gan,Israel,52900"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roi","family":"Fogler","sequence":"additional","affiliation":[{"name":"Bar Ilan University,Department of Computer Science,Ramat Gan,Israel,52900"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[{"name":"Bar Ilan University,Department of Computer Science,Ramat Gan,Israel,52900"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"ref10"},{"key":"ref11","first-page":"447","volume":"10","author":"gold","year":"1967","journal-title":"Language Identification in the Limit Inf Control"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11164-3_26"},{"journal-title":"An Introduction to Computational Learning Theory","year":"1997","author":"kearns","key":"ref13"},{"key":"ref14","first-page":"111","article-title":"Learning Probabilistic Automata for Model Checking, Eighth International Conference on Quantitative Evaluation of Systems","author":"mao","year":"0","journal-title":"QEST 2011 IEEE Computer Society"},{"key":"ref15","first-page":"279","article-title":"Trace Semantics, Proceedings of Advances in Petri Nets, 1986","author":"mazurkiewicz","year":"1987","journal-title":"Bad Honnef Lecture Notes in Computer Science"},{"key":"ref16","first-page":"226","article-title":"A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise","author":"ester","year":"1996","journal-title":"KDD'96 LNCS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"ref18","first-page":"167","article-title":"Languages and Automata","author":"ochmanski","year":"0","journal-title":"The Book of Traces"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/9789812797902_0004"},{"key":"ref28","article-title":"Testing Systems of Concurrent Black-boxes - an Automata-Theoretic and Decompositional Approach","author":"xie","year":"2005","journal-title":"FATES'05 LNCS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_23"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_30"},{"journal-title":"Dynamic Programming","year":"1957","author":"bellman","key":"ref3"},{"journal-title":"Model checking","year":"1999","author":"clarke","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58473-0_144"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1978.231496"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1989.39190"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36577-X_24"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_52"},{"key":"ref20","first-page":"99","article-title":"Identifying regular languages in polynomial time","author":"oncina","year":"1992","journal-title":"Advances in Structural and Syntactic Pattern Recognition"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"ref24","first-page":"223","author":"vaandrager","year":"0","journal-title":"A New Approach for Active Automata Learning Based on Apartness"},{"key":"ref23","first-page":"2825","article-title":"Scikit-learn: Machine Learning in Python","author":"pedregosa","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.741"},{"key":"ref25","first-page":"98","article-title":"Failure diagnosis of automata","author":"vasilevskii","year":"1973","journal-title":"Kibertetika"}],"event":{"name":"2022 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","start":{"date-parts":[[2022,10,13]]},"location":"Shanghai, China","end":{"date-parts":[[2022,10,14]]}},"container-title":["2022 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9954458\/9954381\/09954382.pdf?arnumber=9954382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:08:57Z","timestamp":1671480537000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9954382\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/memocode57689.2022.9954382","relation":{},"subject":[],"published":{"date-parts":[[2022,10,13]]}}}