{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:32Z","timestamp":1759637612705,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5921,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00050-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"229-240","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["VC-dimensions of finite automata and commutative finite automata with k letters and n states"],"prefix":"10.1016","volume":"74","author":[{"given":"Yoshiyasu","family":"Ishigami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sei'ichi","family":"Tani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00050-9_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF03037090","article-title":"Learning commutative deterministic finite state automata in polynomial time","volume":"8","author":"Abe","year":"1991","journal-title":"New Generation Computing"},{"year":"1976","series-title":"The Theory of Partitions","author":"Andrews","key":"10.1016\/S0166-218X(96)00050-9_BIB2"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Learning regular sets from queries and counterexamples","volume":"75","author":"Angluin","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0166-218X(96)00050-9_BIB4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1022692615781","article-title":"Negative results for equivalence queries","volume":"5","author":"Angluin","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB6","series-title":"Proceedings of the International Colloquium on Automata, Languages and Programming","first-page":"82","article-title":"Nonuniform learnability","volume":"Vol. 317","author":"Benedek","year":"1988"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB7","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(89)90037-1","article-title":"A maximin problem on finite automata","volume":"23","author":"Champarnaud","year":"1989","journal-title":"Discrete Appl. Math."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/S0166-218X(96)00050-9_BIB9"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB10","series-title":"Proceedings of the 30th IEEE Symposium on Foundations of Computer Science","first-page":"262","article-title":"On the complexity of learning from counterexamples","author":"Maass","year":"1989"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB11","series-title":"Proceedings of the 31st IEEE Symposium on Foundations of Computer Science","first-page":"203","article-title":"On the complexity of learning from counterexamples and membership queries","author":"Maass","year":"1990"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1022637031594","article-title":"Lower bound methods and separation results for on-line learning models","volume":"9","author":"Maass","year":"1992","journal-title":"Machine Learning"},{"year":"1969","series-title":"Theory of Automata","author":"Salomaa","key":"10.1016\/S0166-218X(96)00050-9_BIB13"},{"key":"10.1016\/S0166-218X(96)00050-9_BIB14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000509?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000509?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:28Z","timestamp":1759060588000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000509"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00050-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1997,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"VC-dimensions of finite automata and commutative finite automata with k letters and n states","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(96)00050-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}