{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:23:37Z","timestamp":1649085817775},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1007\/bf02090778","type":"journal-article","created":{"date-parts":[[2005,8,15]],"date-time":"2005-08-15T03:01:07Z","timestamp":1124074867000},"page":"245-254","source":"Crossref","is-referenced-by-count":4,"title":["It is decidable whether a monadic thue system is canonical over a regular set"],"prefix":"10.1007","volume":"23","author":[{"given":"Paliath","family":"Narendran","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02090778_CR1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(76)90049-9","volume":"3","author":"C. Beeri","year":"1976","unstructured":"Beeri, C., An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines,Theoretical Computer Science,3 (1976), 305\u2013320.","journal-title":"Theoretical Computer Science"},{"key":"BF02090778_CR2","first-page":"1188","volume":"269","author":"M. Benois","year":"1969","unstructured":"Benois, M., Parties Rationelle du Group Libre,Comptes Rendus des S\u00e9ances de l'Acad\u00e9mie des Sciences, S\u00e9rie A,269 (1969), 1188\u20131190.","journal-title":"Comptes Rendus des S\u00e9ances de l'Acad\u00e9mie des Sciences, S\u00e9rie A"},{"key":"BF02090778_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","volume":"3","author":"R. V. Book","year":"1987","unstructured":"Book, R. V., Thue Systems as Rewriting Systems,Journal of Symbolic Computation,3 (1987), 39\u201368.","journal-title":"Journal of Symbolic Computation"},{"key":"BF02090778_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90078-5","volume":"16","author":"R. V. Book","year":"1981","unstructured":"Book, R. V., and \u00d3'D\u00fanlaing, C., Testing for the Church-Rosser Property,Theoretical Computer Science,16 (1981), 223\u2013229.","journal-title":"Theoretical Computer Science"},{"key":"BF02090778_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0212012","volume":"12","author":"J. V. Guttag","year":"1983","unstructured":"Guttag, J. V., Kapur, D., and Musser, D. R., On Proving Uniform Termination and Restricted Termination of Rewriting Systems,SIAM Journal on Computing,12 (1983), 189\u2013214.","journal-title":"SIAM Journal on Computing"},{"key":"BF02090778_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0890-5401(90)90023-B","volume":"86","author":"D. Kapur","year":"1990","unstructured":"Kapur, D., Narendran, P., and Otto, F., On Ground-Confluence of Term Rewriting Systems,Information and Computation,86 (1990), 14\u201331.","journal-title":"Information and Computation"},{"key":"BF02090778_CR7","unstructured":"Nivat, M. (with M. Benois), Congruence Parfaites et Quasi-Parfaites, inSeminaire Dubreil, 25 e Ann\u00e9e, 1971\u201372, 7-01-09."},{"key":"BF02090778_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(87)90017-1","volume":"35","author":"F. Otto","year":"1987","unstructured":"Otto, F., On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class,Journal of Computer and System Sciences,35 (1987), 285\u2013310.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02090778_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-0000(85)90055-8","volume":"31","author":"G. Senizergues","year":"1985","unstructured":"Senizergues, G., The Equivalence and Inclusion Problems for N.T.S. Languages,Journal of Computer and System Sciences,31 (1985), 303\u2013331.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02090778_CR10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","volume":"25","author":"L. G. Valiant","year":"1974","unstructured":"Valiant, L. G., The Equivalence Problem for Deterministic Finite Turn Pushdown Automata,Information and Control,25 (1974), 123\u2013133.","journal-title":"Information and Control"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090778.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02090778\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T10:05:50Z","timestamp":1557828350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02090778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["BF02090778"],"URL":"https:\/\/doi.org\/10.1007\/bf02090778","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}