{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T18:22:35Z","timestamp":1782670955822,"version":"3.54.5"},"reference-count":12,"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":[[2012,11]]},"abstract":"<jats:p> The present paper proposes a new investigation area in automata theory \u2014 jumping finite automata. These automata work like classical finite automata except that they read input words discontinuously \u2014 that is, after reading a symbol, they can jump over some symbols within the words and continue their computation from there. The paper establishes several results concerning jumping finite automata in terms of commonly investigated areas of automata theory, such as decidability and closure properties. Most importantly, it achieves several results that demonstrate differences between jumping finite automata and classical finite automata. In its conclusion, the paper formulates several open problems and suggests future investigation areas. <\/jats:p>","DOI":"10.1142\/s0129054112500244","type":"journal-article","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T09:18:50Z","timestamp":1359537530000},"page":"1555-1578","source":"Crossref","is-referenced-by-count":73,"title":["JUMPING FINITE AUTOMATA"],"prefix":"10.1142","volume":"23","author":[{"given":"ALEXANDER","family":"MEDUNA","sequence":"first","affiliation":[{"name":"Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bo\u017eet\u011bchova 1\/2, 612 66 Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"PETR","family":"ZEMEK","sequence":"additional","affiliation":[{"name":"Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bo\u017eet\u011bchova 1\/2, 612 66 Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2013,1,30]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516518"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.03.002"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054196000191"},{"issue":"3","key":"p_12","first-page":"3550","volume":"12","author":"Jancar P.","year":"2007","journal-title":"Languages and Combinatorics"},{"issue":"4","key":"p_14","first-page":"653","volume":"2000","author":"Kol\u00e1\u0159 D.","year":"2000","journal-title":"Acta Cybernetica"},{"issue":"21","key":"p_15","first-page":"1001","volume":"2001","author":"Kol\u00e1\u0159 D.","year":"2001","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"p_20","first-page":"237","volume":"7","author":"Mart\u00ed-Vide C.","year":"2000","journal-title":"Journal of Applied Mathematics and Computing"},{"issue":"1","key":"p_21","first-page":"135","volume":"18","author":"Masopust T.","year":"2007","journal-title":"Acta Cybernetica"},{"issue":"2","key":"p_22","first-page":"537","volume":"19","author":"Masopust T.","year":"2009","journal-title":"Acta Cybernetica"},{"issue":"98","key":"p_24","first-page":"114","volume":"2006","author":"Meduna A.","year":"2006","journal-title":"Acta Informatica"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00191-1"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1080\/00207160310001650099"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054112500244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:11:21Z","timestamp":1565093481000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054112500244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":12,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2013,1,30]]},"published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1142\/S0129054112500244"],"URL":"https:\/\/doi.org\/10.1142\/s0129054112500244","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}