{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:16:44Z","timestamp":1648923404497},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"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":5099,"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":[[1999,8]]},"DOI":"10.1016\/s0304-3975(98)00179-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"1-63","source":"Crossref","is-referenced-by-count":5,"title":["On the representation of finite deterministic 2-tape automata"],"prefix":"10.1016","volume":"225","author":[{"given":"Maryse","family":"Pelletier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00179-0_BIB1","author":"Barwise","year":"1977"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB2","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB3","series-title":"Logic, Methodology and Philosophy of Science","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB4","volume":"vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB5","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. Dev."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB6","series-title":"Word Processing in Groups","author":"Epstein","year":"1992"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(68)80006-6","article-title":"Multitape One-way nonwriting automata","volume":"2","author":"Fischer","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","article-title":"Synchronized rational relations of finite and infinite words","volume":"108","author":"Frougny","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB9","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(98)00179-0_BIB10","series-title":"Proc. ICALP'85","first-page":"300","article-title":"Do rational equivalence relations have regular cross-sections?","volume":"vol. 194","author":"Johnson","year":"1985"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB11","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. Computer Sci."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB12","first-page":"485","article-title":"On the lexicographic uniformisation of deterministic 2-tape automata","volume":"vol. I","author":"Pelletier","year":"1994"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB13","first-page":"1","article-title":"Finite Automata","volume":"vol. B","author":"Perrin","year":"1990"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB14","first-page":"125","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"I.B.M. J. Res. Develop."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1051\/ita\/1983170100231","article-title":"Deux remarques sur un th\u00e9or\u00e8me de S. Eilenberg","volume":"17","author":"Sakarovitch","year":"1983","journal-title":"R.A.I.R.O Inform. Th\u00e9orique"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB16","series-title":"Trends, Techniques and Problems in Theoretical Computer Science","first-page":"39","article-title":"Kleene's Theorem revisited","volume":"vol. 281","author":"Sakarovitch","year":"1987"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB17","article-title":"A construction on finite automata that has remained hidden","volume":"205","author":"Sakarovitch","year":"1998","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB18","series-title":"Proc. Symp. on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn","first-page":"139","article-title":"Certain elementary families of automata","author":"Sch\u00fctzenberger","year":"1962"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB19","series-title":"Automata Theory and Formal Languages","first-page":"209","article-title":"Sur les relations rationnelles","volume":"vol. 33","author":"Sch\u00fctzenberger","year":"1975"},{"key":"10.1016\/S0304-3975(98)00179-0_BIB20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","article-title":"Sur les relations rationnelles entre mono\u00efdes libres","volume":"3","author":"Sch\u00fctzenberger","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","article-title":"Une variante des fonctions s\u00e9quentielles","volume":"4","author":"Sch\u00fctzenberger","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00179-0_BIB22","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02095993","article-title":"Topology of finite graphs","volume":"71","author":"Stallings","year":"1983","journal-title":"Invent. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001790?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001790?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:59:10Z","timestamp":1556301550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0304397598001790"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00179-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}