{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:16:10Z","timestamp":1784837770762,"version":"3.55.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0166-218x(96)00025-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"123-134","source":"Crossref","is-referenced-by-count":8,"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":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sei'ichi","family":"Tani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00025-X_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"},{"key":"10.1016\/S0166-218X(96)00025-X_BIB2","series-title":"The Theory of Partitions","author":"Andrews","year":"1976"},{"key":"10.1016\/S0166-218X(96)00025-X_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)00025-X_BIB4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0166-218X(96)00025-X_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00116034","article-title":"Negative results for equivalence queries","volume":"5","author":"Angluin","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/S0166-218X(96)00025-X_BIB6","doi-asserted-by":"crossref","unstructured":"G.M. Benedek and A. Itai, Nonuniform learnability, in: Internat. Coll. on Automata, Languages and Programming 1988, Lecture Notes in Computer Science, Vol. 317 (Springer, Berlin) 82\u201392.","DOI":"10.1007\/3-540-19488-6_108"},{"key":"10.1016\/S0166-218X(96)00025-X_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)00025-X_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."},{"key":"10.1016\/S0166-218X(96)00025-X_BIB9","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0166-218X(96)00025-X_BIB10","series-title":"Proc. 30th IEEE Symp. 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)00025-X_BIB11","series-title":"Proc. 31st IEEE Symp. 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)00025-X_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00992674","article-title":"Lower bound methods and separation results for on-line learning models","volume":"9","author":"Maass","year":"1992","journal-title":"Machine Learning"},{"key":"10.1016\/S0166-218X(96)00025-X_BIB13","series-title":"Theory of Automata","author":"Salomaa","year":"1969"},{"key":"10.1016\/S0166-218X(96)00025-X_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:S0166218X9600025X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600025X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:42Z","timestamp":1556130522000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9600025X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X9600025X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00025-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}