{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T03:40:02Z","timestamp":1745552402493,"version":"3.40.4"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:p> Multiautomata are collections of independent finite two-way deterministic automata that read synchronously the same input and are occasionally capable of broadcasting their current states. The reception of such a message affects the run of the automata by resetting them to some deterministically predetermined new state. An input is accepted if a specific automaton, say the first one of the collection, enters an accepting state. We consider the case where the input is on a unary alphabet which can be viewed as an integer. We show that if the number of messages broadcast during the computation is finite, then the set of inputs recognised is a regular language. <\/jats:p>","DOI":"10.1142\/s0129054125430014","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:00:52Z","timestamp":1743220852000},"page":"269-283","source":"Crossref","is-referenced-by-count":0,"title":["Giovanni in Paris"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9849-3514","authenticated-orcid":false,"given":"Christian","family":"Choffrut","sequence":"first","affiliation":[{"name":"IRIF (UMR 8243), CNRS and Universit\u00e9 Paris Cit\u00e9, France"}]}],"member":"219","published-online":{"date-parts":[[2025,3,29]]},"reference":[{"key":"S0129054125430014BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029963"},{"key":"S0129054125430014BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.08.009"},{"key":"S0129054125430014BIB003","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.285"},{"key":"S0129054125430014BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(74)90043-X"},{"key":"S0129054125430014BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_85"},{"key":"S0129054125430014BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342995"},{"key":"S0129054125430014BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-014-0206-x"},{"first-page":"92","volume-title":"Comptes Rendus du I congr\u00e8s de Math\u00e9maticiens des Pays Slaves, Warszawa","author":"Presburger M.","key":"S0129054125430014BIB008"},{"key":"S0129054125430014BIB009","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"S0129054125430014BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(74)90994-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054125430014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T03:17:39Z","timestamp":1745551059000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054125430014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,29]]},"references-count":10,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10.1142\/S0129054125430014"],"URL":"https:\/\/doi.org\/10.1142\/s0129054125430014","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2025,3,29]]}}}