{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:25:53Z","timestamp":1709828753518},"reference-count":11,"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":[[2014,11]]},"abstract":"<jats:p> The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We prove that n! and \u230ae(n \u2212 1)\u230b. are tight upper bounds for the syntactic complexity of \u211b- and \ud835\udca5-trivial regular languages, respectively. <\/jats:p>","DOI":"10.1142\/s0129054114400097","type":"journal-article","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T08:48:03Z","timestamp":1421225283000},"page":"807-821","source":"Crossref","is-referenced-by-count":4,"title":["SYNTACTIC COMPLEXITY OF \u211b- AND \ud835\udca5-TRIVIAL REGULAR LANGUAGES"],"prefix":"10.1142","volume":"25","author":[{"given":"JANUSZ","family":"BRZOZOWSKI","sequence":"first","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BAIYU","family":"LI","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90003-3"},{"key":"p_2","first-page":"160","volume":"8031","author":"Brzozowski J.","year":"2013","journal-title":"LNCS"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.011"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.010"},{"key":"p_8","first-page":"229","volume":"7381","author":"Jir\u00e1skov\u00e1 G.","year":"2012","journal-title":"LNCS"},{"key":"p_9","first-page":"136","volume":"8031","author":"Jir\u00e1skov\u00e1 G.","year":"2013","journal-title":"LNCS"},{"key":"p_12","first-page":"1266","volume":"194","author":"Maslov A. N.","year":"1970","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"p_13","first-page":"57","author":"Myhill J.","year":"1957","journal-title":"Wright Air Development Center Technical Report"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1007\/PL00005967"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"p_19","first-page":"214","author":"Simon I.","year":"1975","journal-title":"UK"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114400097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:36:30Z","timestamp":1565130990000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114400097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":11,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2015,1,14]]},"published-print":{"date-parts":[[2014,11]]}},"alternative-id":["10.1142\/S0129054114400097"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114400097","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}