{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:03:22Z","timestamp":1648886602853},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p> A recent language definition device named consensual is based on agreement between similar words. Considering a language over a bipartite alphabet made by pairs of unmarked\/marked letters, the match relation specifies when such words agree. Thus a set (the \u201cbase\u201d) over the bipartite alphabet consensually specifies another language that includes any terminal word such that a set of corresponding matching words is in the base. We show that all and only the regular languages are consensually generated by a strictly locally testable base; the result is based on a generalization of Medvedev's homomorphic characterization of regular languages. Consensually context-free languages strictly include the base family. The consensual and the base families collapse together if the base is context-sensitive. <\/jats:p>","DOI":"10.1142\/s0129054113400169","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T08:17:54Z","timestamp":1388132274000},"page":"747-763","source":"Crossref","is-referenced-by-count":1,"title":["STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES"],"prefix":"10.1142","volume":"24","author":[{"given":"STEFANO CRESPI","family":"REGHIZZI","sequence":"first","affiliation":[{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria Politecnico di Milano, P. Leonardo da Vinci, 32, Milano 20133, Italia"},{"name":"CNR IEIIT-MI, Milano, Italia"}]},{"given":"PIERLUIGI SAN","family":"PIETRO","sequence":"additional","affiliation":[{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria Politecnico di Milano, P. Leonardo da Vinci, 32, Milano 20133, Italia"},{"name":"CNR IEIIT-MI, Milano, Italia"}]}],"member":"219","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90180-1"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01131538"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00332-6"},{"issue":"1","key":"p_5","first-page":"77","volume":"45","author":"Crespi Reghizzi S.","year":"2011","journal-title":"Inf. and Applic"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054112400710"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02481771"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:10:37Z","timestamp":1565122237000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":6,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,27]]},"published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1142\/S0129054113400169"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400169","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}