{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T02:57:59Z","timestamp":1648609079287},"reference-count":0,"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":[[1991,9]]},"abstract":"<jats:p> In this paper, we investigate the complexity of computing the detector, constructor and lexicographic constructor functions for a given language. The following classes of languages will be considered: (1) context-free languages, (2) regular sets, (3) languages accepted by one-way nondeterministic auxiliary pushdown automata, (4) languages accepted by one-way nondeterministic logspace-bounded Turing machines, (5) two-way deterministic pushdown automaton languages, (6) languages accepted by uniform families of constant-depth polynomial-size Boolean circuits, and (7) languages accepted by multihead finite automata. We show that for the classes (1)\u2013(4), efficient detectors, constructors and lexicographic constructors exist, whereas for (5)\u2013 (7) polynomial-time computable detectors, constructors and lexicographic constructors exist iff there are no sparse sets in NP\u2212P (or equivalently, E=NE). Our results provide sharp boundaries between classes of languages which have efficient detectors, constructors and classes of languages for which efficient detectors and constructors do not appear to exist. <\/jats:p>","DOI":"10.1142\/s0129054191000121","type":"journal-article","created":{"date-parts":[[2004,11,25]],"date-time":"2004-11-25T12:12:21Z","timestamp":1101384741000},"page":"183-205","source":"Crossref","is-referenced-by-count":4,"title":["EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES"],"prefix":"10.1142","volume":"02","author":[{"given":"Dung T.","family":"Huynh","sequence":"first","affiliation":[{"name":"Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054191000121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:53:09Z","timestamp":1565139189000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054191000121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1991,9]]}},"alternative-id":["10.1142\/S0129054191000121"],"URL":"https:\/\/doi.org\/10.1142\/s0129054191000121","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}