{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T12:05:12Z","timestamp":1698667512201},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4946,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0304-3975(99)00020-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"103-111","source":"Crossref","is-referenced-by-count":5,"title":["Efficient implementation of regular languages using reversed alternating finite automata"],"prefix":"10.1016","volume":"231","author":[{"given":"K.","family":"Salomaa","sequence":"first","affiliation":[]},{"given":"X.","family":"Wu","sequence":"additional","affiliation":[]},{"given":"S.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00020-1_BIB1","unstructured":"J. Berstel, M. Morcrette, Compact representation of patterns by finite automata, in: A. Gagalowicz, (Ed.), Pixim 89: L'Image Num\u00e9rique \u00e0 Paris, Hermes, Paris, 1989, pp. 387\u2013395."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","article-title":"On equations for regular languages, finite automata, and sequential networks","volume":"10","author":"Brzozowski","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB3","first-page":"1981","volume":"J. ACM","author":"Chandra","journal-title":"Alternation"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB4","unstructured":"H.K. Cheung, An efficient implementation method for alternating finite automata, M.Sc. Project Paper, Dept. of Computer Science, Univ. of Western Ontario, September 1996."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0167-9260(94)00007-7","article-title":"Two-level logic minimization: an overview","volume":"17","author":"Coudert","year":"1994","journal-title":"VLSI J."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0304-3975(93)90329-R","article-title":"Affine Automata and related techniques for generation of complex images","volume":"116","author":"Culik II","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(99)00020-1_BIB7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0097-8493(93)90079-O","article-title":"Image compression using weighted finite automata","volume":"17","author":"Culik II","year":"1993","journal-title":"Comput. and Graphics"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/00207169008803893","article-title":"Constructions for alternating finite automata","volume":"35","author":"Fellah","year":"1990","journal-title":"Internat. J. Comp. Math."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB9","series-title":"Alternating finite automata and related problems. Ph.D. Dissertation","author":"Fellah","year":"1991"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB10","doi-asserted-by":"crossref","unstructured":"L. Guo, K. Salomaa, S. Yu, Synchronization expressions and languages, Proc. 6th IEEE Symp. on Parallel and Distributed Processing, 1994, pp. 257\u2013264.","DOI":"10.1109\/SPDP.1994.346159"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","article-title":"Statecharts: a visual formalism for complex systems","volume":"8","author":"Harel","year":"1987","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB12","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","article-title":"On the equivalence, containment, and covering problems for the regular and context-free languages","volume":"12","author":"Hunt","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB13","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1137\/0222067","article-title":"Minimal NFA problems are hard","volume":"22","author":"Jiang","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","article-title":"Succinct representation of regular languages by boolean automata","volume":"13","author":"Leiss","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00020-1_BIB15","series-title":"Release Notes for Grail Version 2.5","author":"Raymond","year":"1996"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB16","series-title":"Object-Oriented Modeling and Design","author":"Rumbaugh","year":"1991"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB17","doi-asserted-by":"crossref","unstructured":"L. Stockmeyer, A. Meyer, Word problems requiring exponential time (preliminary report), Proc. 5th ACM Symp. on Theory of Computing, 1973, pp. 1\u20139.","DOI":"10.1145\/800125.804029"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB18","series-title":"Theory of Computation","author":"Wood","year":"1987"},{"key":"10.1016\/S0304-3975(99)00020-1_BIB19","doi-asserted-by":"crossref","unstructured":"S. Yu, Regular Languages, Handbook of Formal Languages, vol. 1, Ch. 2, Springer, Berlin, 1997, pp. 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:22:31Z","timestamp":1555420951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0304397599000201"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00020-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}