{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:37:57Z","timestamp":1648658277535},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00098-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"1-15","source":"Crossref","is-referenced-by-count":1,"title":["Some decisional problems on rational relations"],"prefix":"10.1016","volume":"180","author":[{"given":"Marina","family":"Madonia","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Varricchio","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00098-9_BIB1","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ita\/1985190100431","article-title":"Strong iterative pairs and the regularity of context-free languages","volume":"19","author":"Ehrenfeucht","year":"1985","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/S0304-3975(96)00098-9_BIB3","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0304-3975(96)00098-9_BIB5","first-page":"26","article-title":"Synchronized rational relations of finite and infinite words","author":"Frougny","year":"1992","journal-title":"LITP Report"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(92)90080-Y","article-title":"Star-free trace languages","volume":"97","author":"Guaiana","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00098-9_BIB7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","article-title":"The equivalence problem of multitape finite automata","volume":"78","author":"Harju","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00098-9_BIB8","series-title":"Introduction to Formal Languages Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB9","series-title":"Introduction to Automata Theory, Languages, and Compulation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(86)90132-5","article-title":"Rational equivalence relations","volume":"47","author":"Johnson","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00098-9_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0304-3975(96)00098-9_BIB12","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"8","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00098-9_BIB14","series-title":"Proc. 6th Annual Workshop on Computational Learning Theory","first-page":"228","article-title":"Learning two-tape automata from queries and counterexamples","author":"Yokomori","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000989?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000989?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:58:29Z","timestamp":1555419509000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596000989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596000989"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00098-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}