{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:25:12Z","timestamp":1776288312058,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6225,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00098-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"141-156","source":"Crossref","is-referenced-by-count":16,"title":["On the language of primitive words"],"prefix":"10.1016","volume":"161","author":[{"given":"H.","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00098-4_BIB1","series-title":"Introduction to Analytic Number Theory","author":"Apostol","year":"1976"},{"issue":"41","key":"10.1016\/0304-3975(95)00098-4_BIB2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00098-4_BIB3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","article-title":"Lexicographically least circular substrings","volume":"10","author":"Booth","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00098-4_BIB4","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/0304-3975(95)00098-4_BIB5","first-page":"267","article-title":"Calcul pratique des coefficients de Taylor d'une fonction alg\u00e9brique","volume":"10","author":"Comtet","year":"1964","journal-title":"L'Enseignement Math\u00e9matique"},{"key":"10.1016\/0304-3975(95)00098-4_BIB6","series-title":"Proc. Inf. Proc. 71","first-page":"75","article-title":"Linear time simulation of deterministic two-way pushdown automata","author":"Cook","year":"1972"},{"issue":"3\u20134","key":"10.1016\/0304-3975(95)00098-4_BIB7","first-page":"315","article-title":"Formal languages and primitive words","volume":"42","author":"D\u00f6m\u00f6si","year":"1993","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/0304-3975(95)00098-4_BIB8","series-title":"Proc. FCT93","first-page":"194","article-title":"Formai languages consisting of primitive words","volume":"Vol. 710","author":"D\u00f6m\u00f6si","year":"1993"},{"key":"10.1016\/0304-3975(95)00098-4_BIB9","series-title":"Proc.2nd Internat. Coll. Words, Languages and Combinatorics","first-page":"105","article-title":"Some combinatorial properties of words, and the Chomsky-hierarchy","author":"D\u00f6m\u00f6si","year":"1994"},{"key":"10.1016\/0304-3975(95)00098-4_BIB10","series-title":"Proc. Conf. Semigroups, Automata and Languages","article-title":"Some results on primitive words","author":"D\u00f6m\u00f6si","year":"1994"},{"key":"10.1016\/0304-3975(95)00098-4_BIB11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(87)90011-9","article-title":"Analytic models and ambiguity of context-free languages","volume":"49","author":"Flajolet","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00098-4_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/0304-3975(95)00098-4_BIB13","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(95)00098-4_BIB14","first-page":"333","article-title":"Bounded algol-like languages","volume":"113","author":"Ginsburg","year":"1964","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00098-4_BIB15","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1938"},{"key":"10.1016\/0304-3975(95)00098-4_BIB16","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(95)00098-4_BIB17","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00098-4_BIB18","series-title":"Primitive words are strongly interchangeable but nonlinear","author":"Horv\u00e1th","year":"1993"},{"key":"10.1016\/0304-3975(95)00098-4_BIB19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(92)90137-5","article-title":"Optimal algorithms for computing the canonical form of a circular string","volume":"92","author":"Iliopoulos","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00098-4_BIB20","first-page":"45","article-title":"Automata accepting primitive words","volume":"37","author":"Ito","year":"1988"},{"key":"10.1016\/0304-3975(95)00098-4_BIB21","first-page":"67","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/0304-3975(95)00098-4_BIB22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00098-4_BIB23","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(95)00098-4_BIB24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM = bNcP in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(95)00098-4_BIB25","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0214031","article-title":"An \u201cInterchange Lemma\u201d for context-free languages","volume":"14","author":"Ogden","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00098-4_BIB26","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. Comput. Mach. ACM"},{"key":"10.1016\/0304-3975(95)00098-4_BIB27","first-page":"191","article-title":"Repetitive strings are not context-free","volume":"16","author":"Ross","year":"1982","journal-title":"RAIRO Inform. Theor. Appl.\/Theor. Inform. Appl."},{"key":"10.1016\/0304-3975(95)00098-4_BIB28","series-title":"Proc. FCT77","first-page":"171","article-title":"Disjunctive languages and codes","volume":"Vol. 56","author":"Shyr","year":"1977"},{"key":"10.1016\/0304-3975(95)00098-4_BIB29","series-title":"Studies in Combinatorics","first-page":"100","article-title":"Generating functions","volume":"Vol. 17","author":"Stanley","year":"1978"},{"key":"10.1016\/0304-3975(95)00098-4_BIB30","series-title":"Proc. 6th Annual Symp. on Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000984?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000984?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T18:17:43Z","timestamp":1620929863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595000984"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00098-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}