{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:15:21Z","timestamp":1747455321704,"version":"3.40.5"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,11]]},"abstract":"<jats:p>We study iterated transductions defined by a class of invertible Mealy automata over the binary alphabet. It is shown that in some cases the resulting orbit relation is rational and we determine the complexity of several natural computational problems associated with the iterated transductions. In particular, we show how to compute timestamps and coordinates.<\/jats:p>","DOI":"10.1142\/s0129054114400127","type":"journal-article","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T08:48:03Z","timestamp":1421225283000},"page":"857-875","source":"Crossref","is-referenced-by-count":0,"title":["ITERATION OF INVERTIBLE TRANSDUCTIONS"],"prefix":"10.1142","volume":"25","author":[{"given":"K.","family":"SUTNER","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA 15213, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.054"},{"issue":"1","key":"p_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"Cook M.","year":"2004","journal-title":"Complex Systems"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/S1567-8326(02)00025-5"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1147\/rd.91.0047"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.01.006"},{"key":"p_11","first-page":"128","volume":"231","author":"Grigorchuk R. R.","year":"2000","journal-title":"Proc. Steklov Institute of Math."},{"key":"p_13","first-page":"167","volume":"47","author":"Howard Johnson J.","year":"1986","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"p_16","first-page":"287","volume":"8","author":"Khoussainov B.","year":"2003","journal-title":"J. Autom. Lang. Comb."},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1145\/320924.320930"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02677504"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196705002761"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(90)90196-V"},{"key":"p_31","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1009"},{"key":"p_34","doi-asserted-by":"publisher","DOI":"10.1080\/03081079.2012.695899"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114400127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T21:58:18Z","timestamp":1747432698000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114400127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":14,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2015,1,14]]},"published-print":{"date-parts":[[2014,11]]}},"alternative-id":["10.1142\/S0129054114400127"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114400127","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}