{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T03:10:17Z","timestamp":1709262617492},"publisher-location":"Berlin\/Heidelberg","reference-count":0,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540119736","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0009655","type":"book-chapter","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T05:33:59Z","timestamp":1129872839000},"page":"313-323","source":"Crossref","is-referenced-by-count":0,"title":["The equivalence problem for N.T.S. languages is deoidable"],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"Senizergues","sequence":"first","affiliation":[]}],"member":"297","container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T02:40:49Z","timestamp":1572921649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540119736"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/bfb0009655","relation":{},"subject":[]}}