{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:39:06Z","timestamp":1720201146566},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":1479,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"Ministry of Education Academic Research Fund Tier 1","award":["R146-000-181-112","R252-000-534-112"]},{"DOI":"10.13039\/501100001352","name":"NUS","doi-asserted-by":"publisher","award":["C252-000-087-001"],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1016\/j.tcs.2017.12.031","type":"journal-article","created":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T18:05:33Z","timestamp":1514397933000},"page":"66-81","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Learning pattern languages over groups"],"prefix":"10.1016","volume":"742","author":[{"given":"Rupert","family":"H\u00f6lzl","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2017.12.031_br0010","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","article-title":"Inductive inference of formal languages from positive data","volume":"45","author":"Angluin","year":"1980","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2017.12.031_br0020","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2017.12.031_br0030","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/inco.1998.2782","article-title":"The synthesis of language learners","volume":"152","author":"Baliga","year":"1999","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2017.12.031_br0040","series-title":"Theory of Algorithms and Programs, vol. 1","first-page":"82","article-title":"Two theorems on the limiting synthesis of functions","author":"B\u0101rzdi\u0146\u0161","year":"1974"},{"key":"10.1016\/j.tcs.2017.12.031_br0050","series-title":"Automatic structures","author":"Blumensath","year":"1999"},{"key":"10.1016\/j.tcs.2017.12.031_br0060","series-title":"Fifteenth Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, LICS 2000","first-page":"51","article-title":"Automatic structures","author":"Blumensath","year":"2000"},{"key":"10.1016\/j.tcs.2017.12.031_br0070","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2017.12.031_br0080","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.jcss.2013.12.001","article-title":"Automatic learners with feedback queries","volume":"80","author":"Case","year":"2014","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/j.tcs.2017.12.031_br0090","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-9(3:19)2013","article-title":"Automatic functions, linear time and learning","volume":"9","author":"Case","year":"2013","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.tcs.2017.12.031_br0100","series-title":"Proceedings of the Nineth International Colloquium on Automata, Languages and Programming, ICALP 1982","first-page":"107","article-title":"Machine inductive inference and language identification","volume":"vol. 140","author":"Case","year":"1982"},{"key":"10.1016\/j.tcs.2017.12.031_br0110","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.12.031_br0120","series-title":"Algorithmic Learning Theory: 22nd International Workshop (ALT' 2011)","first-page":"84","article-title":"Learning relational patterns","volume":"vol. 6925","author":"Geilke","year":"2011"},{"key":"10.1016\/j.tcs.2017.12.031_br0130","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":"10.1016\/j.tcs.2017.12.031_br0140","series-title":"Abstract Algebra","author":"Grillet","year":"2007"},{"key":"10.1016\/j.tcs.2017.12.031_br0150","series-title":"Th\u00e9ories d\u00e9cidables par automate fini","author":"Hodgson","year":"1976"},{"issue":"1","key":"10.1016\/j.tcs.2017.12.031_br0160","first-page":"39","article-title":"D\u00e9cidabilit\u00e9 par automate fini","volume":"7","author":"Hodgson","year":"1983","journal-title":"Ann. Sci. Math. Qu\u00e9bec"},{"key":"10.1016\/j.tcs.2017.12.031_br0170","series-title":"Algorithmic Learning Theory: 27th International Workshop (ALT' 2016)","first-page":"174","article-title":"Learning pattern languages over groups","volume":"vol. 9925","author":"H\u00f6lzl","year":"2016"},{"key":"10.1016\/j.tcs.2017.12.031_br0180","series-title":"Ninth International Computer Science Symposium in Russia. Proceedings","first-page":"204","article-title":"Semiautomatic structures. Computer science \u2013 theory and applications","volume":"vol. 8476","author":"Jain","year":"2014"},{"key":"10.1016\/j.tcs.2017.12.031_br0190","doi-asserted-by":"crossref","first-page":"1910","DOI":"10.1016\/j.jcss.2011.12.011","article-title":"Learnability of automatic classes","volume":"78","author":"Jain","year":"2012","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2017.12.031_br0200","series-title":"27th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) 2012","first-page":"405","article-title":"The complexity of Verbal Languages over Groups","author":"Jain","year":"2012"},{"key":"10.1016\/j.tcs.2017.12.031_br0210","series-title":"Proceedings of the eleventh Asian Logic Conference in honour of Professor Chong Chi Tat on his sixtieth birthday","first-page":"94","article-title":"On automatic families","author":"Jain","year":"2012"},{"issue":"2","key":"10.1016\/j.tcs.2017.12.031_br0220","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.jalgebra.2006.03.033","article-title":"Elementary theory of free non-Abelian groups","volume":"302","author":"Kharlampovich","year":"2006","journal-title":"J. Algebra"},{"issue":"1","key":"10.1016\/j.tcs.2017.12.031_br0230","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1142\/S021819671350001X","article-title":"Definable subsets in a hyperbolic group","volume":"23","author":"Kharlampovich","year":"2013","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/j.tcs.2017.12.031_br0240","series-title":"Proceedings of Logic Colloquium 2007","first-page":"132","article-title":"Three lectures on automatic structures","volume":"vol. 35","author":"Khoussainov","year":"2010"},{"key":"10.1016\/j.tcs.2017.12.031_br0250","series-title":"Logical and Computational Complexity (International Workshop LCC 1994)","first-page":"367","article-title":"Automatic presentations of structures","volume":"vol. 960","author":"Khoussainov","year":"1995"},{"key":"10.1016\/j.tcs.2017.12.031_br0260","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037093","article-title":"Polynomial time inference of arbitrary pattern languages","volume":"8","author":"Lange","year":"1991","journal-title":"New Gener. Comput."},{"key":"10.1016\/j.tcs.2017.12.031_br0270","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1006\/jcss.1996.0051","article-title":"Incremental learning from positive data","volume":"53","author":"Lange","year":"1996","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/j.tcs.2017.12.031_br0280","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s00224-012-9394-3","article-title":"On rationality of verbal subsets in a group","volume":"52","author":"Myasnikov","year":"2013","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2017.12.031_br0290","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2178\/bsl\/1186666149","article-title":"Describing groups","volume":"13","author":"Nies","year":"2007","journal-title":"Bull. Symbolic Logic"},{"key":"10.1016\/j.tcs.2017.12.031_br0300","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/j.jalgebra.2007.04.015","article-title":"FA-presentable groups and rings","volume":"320","author":"Nies","year":"2008","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2017.12.031_br0310","series-title":"Twentysecond Annual Symposium on Theoretical Aspects of Computer Science (STACS 2005), Stuttgart, Germany, Proceedings","first-page":"693","article-title":"Automatic presentations for finitely generated groups","volume":"vol. 3404","author":"Oliver","year":"2005"},{"key":"10.1016\/j.tcs.2017.12.031_br0320","series-title":"An Introduction to Learning Theory for Cognitive and Computer Scientists","article-title":"Systems that learn","author":"Osherson","year":"1986"},{"key":"10.1016\/j.tcs.2017.12.031_br0330","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","article-title":"Criteria for language learning","volume":"52","author":"Osherson","year":"1982","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2017.12.031_br0340","series-title":"Analogical and Inductive Inference, Proceedings of the Second International Workshop, AII 1989","first-page":"18","article-title":"Inductive inference, DFAs, and computational complexity","volume":"vol. 397","author":"Pitt","year":"1989"},{"key":"10.1016\/j.tcs.2017.12.031_br0350","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.tcs.2005.10.017","article-title":"A non-learnable class of E-pattern languages","volume":"350","author":"Reidenbach","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.12.031_br0360","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2178\/bsl\/1208442827","article-title":"Automata presenting structures: a survey of the finite string case","volume":"14","author":"Rubin","year":"2008","journal-title":"Bull. Symbolic Logic"},{"key":"10.1016\/j.tcs.2017.12.031_br0370","series-title":"RIMS Symposia on Software Science and Engineering, Kyoto, Japan, Proceedings","first-page":"115","article-title":"Polynomial time inference of extended regular pattern languages","volume":"vol. 147","author":"Shinohara","year":"1982"},{"key":"10.1016\/j.tcs.2017.12.031_br0380","series-title":"Algorithmic Learning Theory: 7th International Workshop (ALT' 1996)","first-page":"256","article-title":"Inductive inference of unbounded unions of pattern languages from positive data","volume":"vol. 1160","author":"Shinohara","year":"1996"},{"issue":"4","key":"10.1016\/j.tcs.2017.12.031_br0390","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.2178\/jsl\/1318338853","article-title":"The additive group of the rationals does not have an automatic presentation","volume":"76","author":"Todor","year":"2011","journal-title":"J. Symbolic Logic"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2017.12.031_br0400","first-page":"93","article-title":"Limes-Erkennung rekursiver Funktionen durch spezielle Strategien","volume":"12","author":"Wiehagen","year":"1976","journal-title":"J. Inf. Process. Cybern."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751730926X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751730926X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:42:34Z","timestamp":1663548154000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751730926X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":40,"alternative-id":["S030439751730926X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.12.031","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Learning pattern languages over groups","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.12.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}