{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:29Z","timestamp":1725565229441},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223931"},{"type":"electronic","value":"9783540278122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27812-2_6","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T23:45:36Z","timestamp":1284421536000},"page":"60-67","source":"Crossref","is-referenced-by-count":3,"title":["Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages"],"prefix":"10.1007","author":[{"given":"P\u00e1l","family":"D\u00f6m\u00f6si","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.5486\/PMD.1993.1356","volume":"42","author":"P. D\u00f6m\u00f6si","year":"1993","unstructured":"D\u00f6m\u00f6si, P., Horvath, S., Ito, M.: Formal languages and primitive words. Publ. Math. Debrecen\u00a042, 315\u2013321 (1993)","journal-title":"Publ. Math. Debrecen"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society\u00a016, 109\u2013114 (1965)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"6_CR3","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0304-3975(94)00042-5","volume":"132","author":"L. Ilie","year":"1994","unstructured":"Ilie, L.: On a conjecture about slender context-free languages. Theoret. Comput. Sci.\u00a0132, 427\u2013434 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-642-60207-8_3","volume-title":"Jewels are Forever","author":"B. Imreh","year":"1999","unstructured":"Imreh, B., Ito, M.: On some special classes of regular languages. In: Karhum\u00e4ki, J., Maurer, H., P\u02d8, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 25\u201334. Springer, Heidelberg (1999)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0019-9958(81)90253-9","volume":"51","author":"M. Kunze","year":"1981","unstructured":"Kunze, M., Shyr, H.J., Thierrin, G.: h-bounded and semidiscrete languages. Inform. Control\u00a051, 147\u2013187 (1981)","journal-title":"Inform. Control"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00207168308803373","volume":"14","author":"M. Latteux","year":"1983","unstructured":"Latteux, M., Thierrin, G.: Semidiscrete context-free languages, Internat. J. Comput. Math.\u00a014, 3\u201318 (1983)","journal-title":"J. Comput. Math."},{"key":"6_CR8","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation aM = bNcP in a free group. Michigan Math. J.\u00a09, 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0166-218X(94)00014-5","volume":"61","author":"G. P\u0103un","year":"1995","unstructured":"P\u0103un, G., Salomaa, A.: Thin and slender languages. Discrete Appl. Math.\u00a061, 257\u2013270 (1995)","journal-title":"Discrete Appl. Math."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(96)00308-8","volume":"183","author":"D. Raz","year":"1997","unstructured":"Raz, D.: Length considerations in context-free languages. Theoret. Comput. Sci.\u00a0183, 21\u201332 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR12","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"},{"key":"6_CR13","unstructured":"Shallit, J.: Numeration systems, linear recurrences, and regular sets. Research Report CS-91-32 (July 1991), Computer Science Department, University of Waterloo, Canada"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-55719-9_66","volume-title":"Automata, Languages and Programming","author":"J. Shallit","year":"1992","unstructured":"Shallit, J.: Numeration systems, linear recurrences, and regular sets (Extended abstract). In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 89\u2013100. Springer, Heidelberg (1992)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/inco.1994.1076","volume":"113","author":"J. Shallit","year":"1994","unstructured":"Shallit, J.: Numeration systems, linear recurrences, and regular sets. Information and Computation\u00a0113, 331\u2013347 (1994)","journal-title":"Information and Computation"},{"key":"6_CR16","volume-title":"Free Monoids and Languages","author":"H.J. Shyr","year":"1991","unstructured":"Shyr, H.J.: Free Monoids and Languages. Ho Min Book Company, Taiwan (1991)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-08442-8_83","volume-title":"Fundamentals of Computation Theory","author":"H.J. Shyr","year":"1977","unstructured":"Shyr, H.J., Thierrin, G.: Disjunctive languages and codes. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol.\u00a056, pp. 171\u2013176. Springer, Heidelberg (1977)"},{"key":"6_CR18","first-page":"535","volume":"20","author":"H.J. Shyr","year":"1994","unstructured":"Shyr, H.J., Yu, S.S.: Non-primitive words in the language p\u2009+\u2009q\u2009+\u2009. Soochow J. Math.\u00a020, 535\u2013546 (1994)","journal-title":"Soochow J. Math."}],"container-title":["Lecture Notes in Computer Science","Theory Is Forever"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27812-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T04:39:36Z","timestamp":1685767176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27812-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223931","9783540278122"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27812-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}