{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:54:54Z","timestamp":1752360894834},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p> The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA. Problems decidable for deterministic CA are nonetheless shown to remain decidable for unambiguous CA, and testing for regularity is added to this set of decidable problems. Unambiguous CA are then shown incomparable with deterministic reversal-bounded machines in terms of expressivity, and a deterministic model equivalent to unambiguous CA is identified. <\/jats:p>","DOI":"10.1142\/s0129054113400339","type":"journal-article","created":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T07:16:43Z","timestamp":1393485403000},"page":"1099-1116","source":"Crossref","is-referenced-by-count":6,"title":["UNAMBIGUOUS CONSTRAINED AUTOMATA"],"prefix":"10.1142","volume":"24","author":[{"given":"MICHA\u00cbL","family":"CADILHAC","sequence":"first","affiliation":[{"name":"Laboratoire d'informatique th\u00e9orique et quantique, D\u00e9partement d'informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, C.P. 6128 succursale Centre-ville, Montr\u00e9al (Qu\u00e9bec), H3C 3J7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALAIN","family":"FINKEL","sequence":"additional","affiliation":[{"name":"LSV, ENS Cachan, CNRS, 61 av. du Pr\u00e9sident Wilson, F-94230 Cachan, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PIERRE","family":"MCKENZIE","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Montr\u00e9al and Chaire Digiteo ENS Cachan-\u00c9cole Polytechnique, C.P. 6128 succursale Centre-ville, Montr\u00e9al (Qu\u00e9bec), H3C 3J7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00033-X"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.285"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1966-0201310-3"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"p_10","first-page":"681","volume":"2719","author":"Klaedtke F.","year":"2003","journal-title":"LNCS"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00200-6"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:00:28Z","timestamp":1565118028000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":7,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2014,2,26]]},"published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1142\/S0129054113400339"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400339","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}