{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T12:11:24Z","timestamp":1772885484760,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642143212","type":"print"},{"value":"9783642143229","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14322-9_19","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T10:01:06Z","timestamp":1280397666000},"page":"255-265","source":"Crossref","is-referenced-by-count":61,"title":["On Languages Piecewise Testable in the Strict Sense"],"prefix":"10.1007","author":[{"given":"James","family":"Rogers","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Heinz","sequence":"additional","affiliation":[]},{"given":"Gil","family":"Bailey","sequence":"additional","affiliation":[]},{"given":"Matt","family":"Edlefsen","sequence":"additional","affiliation":[]},{"given":"Molly","family":"Visscher","sequence":"additional","affiliation":[]},{"given":"David","family":"Wellcome","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Wibel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1162\/153244303322533197","volume":"3","author":"N. Cancedda","year":"2003","unstructured":"Cancedda, N., Gaussier, E., Goutte, C., Renders, J.M.: Word-sequence kernels. Journal of Machine Learning Research\u00a03, 1059\u20131082 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Chomsky, N.: Three models for the description of language. I.R.E. Transactions on Information Theory IT-2, 113\u2013123 (1956); reprinted in Readings in Mathematical Psychology. In: Duncan Luce, R., Bush, R.R., Galanter, E. (eds.), vol.\u00a0II, pp. 113\u2013123. John Wiley & Sons, New York (1956)","DOI":"10.1109\/TIT.1956.1056813"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1086\/465544","volume":"4","author":"E.D. Cook","year":"1978","unstructured":"Cook, E.D.: The synchronic and diachronic status of Sarcee g y . International Journal of American Linguistics\u00a04, 192\u2013196 (1978)","journal-title":"International Journal of American Linguistics"},{"key":"19_CR4","unstructured":"Cook, E.D.: A Sarcee Grammar. University of British Columbia Press (1984)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tics.2003.11.006","volume":"8","author":"J. Grainger","year":"2004","unstructured":"Grainger, J., Whitney, C.: Does the huamn mnid raed wrods as a wlohe? Trends in Cognitive Science\u00a08, 58\u201359 (2004)","journal-title":"Trends in Cognitive Science"},{"key":"19_CR6","unstructured":"Hansson, G.: Theoretical and typological issues in consonant harmony. Ph.D. thesis, University of California, Berkeley (2001)"},{"key":"19_CR7","unstructured":"Heinz, J.: The Inductive Learning of Phonotactic Patterns. Ph.D. thesis, University of California, Los Angeles (2007)"},{"key":"19_CR8","unstructured":"Heinz, J.: Learning long distance phonotactics (2008) (submitted manuscipt)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathmatical Society\u00a02, 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathmatical Society"},{"key":"19_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"2001","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory. In: Languages, and Computation. Addison-Wesley, Reading (2001)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1017\/CBO9780511597855.007","volume-title":"Natural Language Parsing","author":"A.K. Joshi","year":"1985","unstructured":"Joshi, A.K.: Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions? In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206\u2013250. Cambridge University Press, Cambridge (1985)"},{"key":"19_CR12","unstructured":"Kobele, G.: Generating Copies: An Investigation into Structural Identity in Language and Grammar. Ph.D. thesis, University of California, Los Angeles (2006)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.tcs.2008.06.037","volume":"405","author":"L.A. Kontorovich","year":"2008","unstructured":"Kontorovich, L.A., Cortes, C., Mohri, M.: Kernel methods for learning languages. Theoretical Computer Science\u00a0405(3), 223\u2013236 (2008)","journal-title":"Theoretical Computer Science"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1162\/153244302760200687","volume":"2","author":"H. Lodhi","year":"2002","unstructured":"Lodhi, H., Cristianini, N., Shawe-Taylor, J., Watkins, C.: Text classification using string kernels. Journal of Machine Language Research\u00a02, 419\u2013444 (2002)","journal-title":"Journal of Machine Language Research"},{"key":"19_CR15","volume-title":"Combinatorics on Words","year":"1997","unstructured":"Lothaire, M. (ed.): Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"19_CR16","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"19_CR17","first-page":"1","volume-title":"Proceedings of 10th Mathematics of Language Conference","author":"J. Rogers","year":"2007","unstructured":"Rogers, J., Pullum, G.: Aural pattern recognition experiments and the subregular hierarchy. In: Kracht, M. (ed.) Proceedings of 10th Mathematics of Language Conference, pp. 1\u20137. University of California, Los Angeles (2007)"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1353\/lan.2004.0144","volume":"80","author":"S. Rose","year":"2004","unstructured":"Rose, S., Walker, R.: A typology of consonant agreement as correspondence. Language\u00a080(3), 475\u2013531 (2004)","journal-title":"Language"},{"key":"19_CR19","first-page":"105","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics and Its Applications","author":"J. Sakarovitch","year":"1983","unstructured":"Sakarovitch, J., Simon, I.: Subwords. In: Lothaire, M. (ed.) Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, vol.\u00a017, ch. 6, pp. 105\u2013134. Addison-Wesley, Reading (1983)"},{"key":"19_CR20","volume-title":"Kernel Methods for Pattern Analysis","author":"J. Shawe-Taylor","year":"2005","unstructured":"Shawe-Taylor, J., Christianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"S. Shieber","year":"1985","unstructured":"Shieber, S.: Evidence against the context-freeness of natural language. Linguistics and Philosophy\u00a08, 333\u2013343 (1985)","journal-title":"Linguistics and Philosophy"},{"key":"19_CR22","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":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-44669-9_33","volume-title":"Fundamentals of Computation Theory","author":"A. Trahtman","year":"2001","unstructured":"Trahtman, A.: Piecewise and local threshold testability of DFA. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 347\u2013358. Springer, Heidelberg (2001)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/01690960701579771","volume":"23","author":"C. Whitney","year":"2008","unstructured":"Whitney, C., Cornelissen, P.: SERIOL reading. Language and Cognitive Processes\u00a023, 143\u2013164 (2008)","journal-title":"Language and Cognitive Processes"}],"container-title":["Lecture Notes in Computer Science","The Mathematics of Language"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14322-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:06Z","timestamp":1606186266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14322-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143212","9783642143229"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14322-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}