{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:32:53Z","timestamp":1778293973666,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":10273,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0022-0000(85)90051-0","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"343-358","source":"Crossref","is-referenced-by-count":17,"title":["Complexity of certain decision problems about congruential languages"],"prefix":"10.1016","volume":"30","author":[{"given":"Paliath","family":"Narendran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colm","family":"\u00d3'D\u00fanlaing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinrich","family":"Rolletschek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90051-0_BIB1","series-title":"S\u00e9minaire d'Informatique Th\u00e9orique","first-page":"123","article-title":"Congruences plus que parfaites et langages alg\u00e9briques","author":"Berstel","year":"1976"},{"key":"10.1016\/0022-0000(85)90051-0_BIB2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","article-title":"Confluent and other types of Thue systems","volume":"29","author":"Book","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90051-0_BIB3","series-title":"Results on Thue systems and semigroups, research announcement","author":"Book","year":"1980"},{"key":"10.1016\/0022-0000(85)90051-0_BIB4","doi-asserted-by":"crossref","unstructured":"E. Cardoza, R. Lipton, A.R. Meyer, Exponential space complete problems for petri nets and commutative semigroups, in \u201cProceedings 8th Ann. Sympos. on Theory of Computing, 1976\u201d pp. 50\u201354.","DOI":"10.1145\/800113.803630"},{"key":"10.1016\/0022-0000(85)90051-0_BIB5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02572815","article-title":"Thue congruences and the Church-Rosser property","volume":"22","author":"Book","year":"1981","journal-title":"Semigroup Forum"},{"key":"10.1016\/0022-0000(85)90051-0_BIB6","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1090\/S0002-9947-1936-1501858-0","article-title":"Some properties of conversion","volume":"39","author":"Church","year":"1936","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(85)90051-0_BIB7","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/0022-0000(85)90051-0_BIB8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/malq.19710170117","article-title":"Strong computability and variants of the uniform halting problem","volume":"17","author":"Herman","year":"1971","journal-title":"Z. Math. Logik. Grundlag. Math."},{"issue":"No. 2","key":"10.1016\/0022-0000(85)90051-0_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2307\/2269811","article-title":"The undecidability of the Turing machine immortality problem","volume":"31","author":"Hooper","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(85)90051-0_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(85)90051-0_BIB11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90051-0_BIB12","series-title":"The Art of Computer Programming 1 (fundamental algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(85)90051-0_BIB13","series-title":"The Reachability Problem Requires Exponential Space","author":"Lipton","year":"1975"},{"key":"10.1016\/0022-0000(85)90051-0_BIB14","article-title":"Church-Rosser and related Thue systems","author":"Narendran","year":"1984"},{"key":"10.1016\/0022-0000(85)90051-0_BIB15","series-title":"Proceedings 2nd ACM Sympos. on Theory of Computing","first-page":"221","article-title":"On some families of languages related to the Dyck Language","author":"Nivat","year":"1970"},{"key":"10.1016\/0022-0000(85)90051-0_BIB16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","article-title":"Infinite regular Thue systems","volume":"25","author":"\u00d3'D\u00fanlaing","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90051-0_BIB17","series-title":"Encoding Complexities in Finite, Length-reducing, Confluent Thue Systems","author":"Otto","year":"1983"},{"key":"10.1016\/0022-0000(85)90051-0_BIB18","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0022-0000(85)90051-0_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","article-title":"Recursive unsolvability of a problem of Thue","volume":"12","author":"Post","year":"1947","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(85)90051-0_BIB20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","article-title":"The covering and boundedness problems for vector addition systems","volume":"6","author":"Rackoff","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90051-0_BIB21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T14:48:46Z","timestamp":1585320526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0022000085900510"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90051-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}