{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:51:50Z","timestamp":1764557510813},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"06n07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:p> In this paper, we present two concise representations of reversible automata. Both representations have a size comparable to the size of the minimum equivalent deterministic automaton and can be exponentially smaller than the size of the explicit representations of corresponding reversible automata. Using these representations it is possible to simulate the computations of reversible automata without explicitly writing down their complete descriptions. <\/jats:p>","DOI":"10.1142\/s0129054119400331","type":"journal-article","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T07:06:43Z","timestamp":1568876803000},"page":"1157-1175","source":"Crossref","is-referenced-by-count":6,"title":["Concise Representations of Reversible Automata"],"prefix":"10.1142","volume":"30","author":[{"given":"Giovanna J.","family":"Lavado","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, via Comelico, 39\/41 Milan, 20135, Italy"}]},{"given":"Luca","family":"Prigioniero","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, via Comelico, 39\/41 Milan, 20135, Italy"}]}],"member":"219","published-online":{"date-parts":[[2019,9,19]]},"reference":[{"key":"S0129054119400331BIB001","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"S0129054119400331BIB002","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009"},{"key":"S0129054119400331BIB003","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.252.13"},{"key":"S0129054119400331BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21500-6_22"},{"key":"S0129054119400331BIB005","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"S0129054119400331BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646094"},{"key":"S0129054119400331BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48057-1_3"},{"key":"S0129054119400331BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08494-7_4"},{"key":"S0129054119400331BIB010","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"S0129054119400331BIB011","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1672"},{"issue":"1","key":"S0129054119400331BIB012","first-page":"145","volume":"22","author":"Lavado G. J.","year":"2017","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"S0129054119400331BIB013","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.252.15"},{"key":"S0129054119400331BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60252-3_19"},{"key":"S0129054119400331BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023844"},{"key":"S0129054119400331BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10003-2_104"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119400331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T07:07:16Z","timestamp":1568876836000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119400331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":15,"journal-issue":{"issue":"06n07","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.1142\/S0129054119400331"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119400331","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}