{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:07:37Z","timestamp":1769306857007,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642399978","type":"print"},{"value":"9783642399985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39998-5_6","type":"book-chapter","created":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T21:59:20Z","timestamp":1375135160000},"page":"90-108","source":"Crossref","is-referenced-by-count":65,"title":["Cognitive and Sub-regular Complexity"],"prefix":"10.1007","author":[{"given":"James","family":"Rogers","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Heinz","sequence":"additional","affiliation":[]},{"given":"Margaret","family":"Fero","sequence":"additional","affiliation":[]},{"given":"Jeremy","family":"Hurst","sequence":"additional","affiliation":[]},{"given":"Dakotah","family":"Lambert","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Wibel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1111\/j.1467-9922.2010.00606.x","volume":"60","author":"V. Folia","year":"2010","unstructured":"Folia, V., Udd\u00e9n, J., de Vries, M., Forkstam, C., Petersson, K.M.: Artificial language learning in adults and children. Language Learning\u00a060, 188\u2013220 (2010)","journal-title":"Language Learning"},{"issue":"5598","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1126\/science.298.5598.1569","volume":"298","author":"M.D. Hauser","year":"2002","unstructured":"Hauser, M.D., Chomsky, N., Fitch, W.T.: The faculty of language: What is it, who has it, and how did it evolve? Science\u00a0298(5598), 1569\u20131579 (2002)","journal-title":"Science"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1162\/LING_a_00015","volume":"41","author":"J. Heinz","year":"2010","unstructured":"Heinz, J.: Learning long-distance phonotactics. Linguistic Inquiry\u00a041(4), 623\u2013661 (2010)","journal-title":"Linguistic Inquiry"},{"issue":"6040","key":"6_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1126\/science.1210358","volume":"333","author":"J. Heinz","year":"2011","unstructured":"Heinz, J., Idsardi, W.: Sentence and word complexity. Science\u00a0333(6040), 295\u2013297 (2011)","journal-title":"Science"},{"key":"6_CR5","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press (1971)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata and related arithmetics. Transactions of the American Mathematical Society\u00a098, 21\u201351 (1961)","journal-title":"Transactions of the American Mathematical Society"},{"key":"6_CR8","unstructured":"Hayes, B.: Metrical Stress Theory. Chicago University Press (1995)"},{"key":"6_CR9","volume-title":"A survey of word accentual patterns in the languages of the world","year":"2010","unstructured":"van der Hulst, H., Goedemans, R., van Zanten, E. (eds.): A survey of word accentual patterns in the languages of the world. Mouton de Gruyter, Berlin (2010)"},{"key":"6_CR10","unstructured":"Heinz, J.: The Inductive Learning of Phonotactic Patterns. PhD thesis, University of California, Los Angeles (2007)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1017\/S0952675709990145","volume":"26","author":"J. Heinz","year":"2009","unstructured":"Heinz, J.: On the role of locality in learning stress patterns. Phonology\u00a026(2), 303\u2013351 (2009)","journal-title":"Phonology"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (2001)","DOI":"10.1145\/568438.568455"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kracht, M.: The Mathematics of Language. Mouton de Gruyter (2003)","DOI":"10.1515\/9783110895667"},{"key":"6_CR14","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press (1972)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"6_CR16","unstructured":"Garcia, P., Vidal, E., Oncina, J.: Learning locally testable languages in the strict sense. In: Proceedings of the Workshop on Algorithmic Learning Theory, pp. 325\u2013338 (1990)"},{"key":"6_CR17","unstructured":"Edlefsen, M., Leeman, D., Myers, N., Smith, N., Visscher, M., Wellcome, D.: Deciding strictly local (SL) languages. In: Breitenbucher, J. (ed.) Proceedings of the Midstates Conference for Undergraduate Research in Computer Science and Mathematics, pp. 66\u201373 (2008)"},{"key":"6_CR18","unstructured":"Heinz, J.: UD phonology lab stress pattern database (March 2012), \n                    \n                      http:\/\/phonology.cogsci.udel.edu\/dbs\/stress\/"},{"key":"6_CR19","unstructured":"Graf, T.: Comparing incomparable frameworks: A model theoretic approach to phonology. University of Pennsylvania Working Papers in Linguistics\u00a016(2), Article 10 (2010), \n                    \n                      http:\/\/repository.upenn.edu\/pwpl\/vol16\/iss1\/10"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Hyman, L.M.: How (not) to do phonological typology: the case of pitch-accent. Language Sciences\u00a031(2-3), 213\u2013238 (2009); Data and Theory: Papers in Phonology in Celebration of Charles W. Kisseberth","DOI":"10.1016\/j.langsci.2008.12.007"},{"key":"6_CR21","first-page":"125","volume":"7","author":"P. Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, P., Ruiz, J.: Learning k-testable and k-piecewise testable languages from positive data. Grammars\u00a07, 125\u2013140 (2004)","journal-title":"Grammars"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and Systems Sciences\u00a025, 360\u2013376 (1982)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"6_CR23","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-14322-9_19","volume-title":"The Mathematics of Language","author":"J. Rogers","year":"2010","unstructured":"Rogers, J., Heinz, J., Bailey, G., Edlefsen, M., Visscher, M., Wellcome, D., Wibel, S.: On languages piecewise testable in the strict sense. In: Ebert, C., J\u00e4ger, G., Michaelis, J. (eds.) MOL 10. LNCS (LNAI), vol.\u00a06149, pp. 255\u2013265. Springer, Heidelberg (2010)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-32024-8_14","volume-title":"Formal Grammar","author":"T. Graf","year":"2012","unstructured":"Graf, T.: Locality and the complexity of minimalist derivation tree languages. In: de Groote, P., Nederhof, M.-J. (eds.) Formal Grammar 2010\/2011. LNCS, vol.\u00a07395, pp. 208\u2013227. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39998-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T01:48:26Z","timestamp":1557971306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39998-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399978","9783642399985"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39998-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}