{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T03:00:13Z","timestamp":1693623613082},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p> We explore expression automata with respect to determinism and minimization. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano's definition of deterministic generalized automata. We prove that deterministic expression automata languages are a proper subfamily of the regular languages. We close by defining the minimization of deterministic expression automata. <\/jats:p>","DOI":"10.1142\/s0129054105003121","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T14:52:13Z","timestamp":1120575133000},"page":"499-510","source":"Crossref","is-referenced-by-count":12,"title":["THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA"],"prefix":"10.1142","volume":"16","author":[{"given":"YO-SUB","family":"HAN","sequence":"first","affiliation":[{"name":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR, China"}]},{"given":"DERICK","family":"WOOD","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"67","author":"Brzozowski J.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"rf2","volume-title":"Automata, Languages, and Machines","author":"Eilenberg S.","year":"1974"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00166-7"},{"key":"rf4","doi-asserted-by":"crossref","unstructured":"J.\u00a0Hopcroft, Theory of Machines and Computations, eds. Z.\u00a0Kohavi and A.\u00a0Paz (Academic Press, New York, NY, 1971)\u00a0pp. 189\u2013196.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"rf5","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J.","year":"1979"},{"key":"rf6","doi-asserted-by":"crossref","unstructured":"E.\u00a0Moore, Automata Studies, eds. C.\u00a0Shannon and J.\u00a0McCarthy (Princeton University Press, Princeton, NJ, 1956)\u00a0pp. 129\u2013153.","DOI":"10.1515\/9781400882618-006"},{"key":"rf7","doi-asserted-by":"crossref","unstructured":"D.\u00a0Perrin, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science\u00a0B, ed. J.\u00a0van Leeuwen (The MIT Press, Cambridge, MA, 1990)\u00a0pp. 1\u201357.","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"rf9","volume-title":"Theory of Computation","author":"Wood D.","year":"1987"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:39:40Z","timestamp":1565138380000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":8,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S0129054105003121"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003121","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}