{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:27Z","timestamp":1759637967094},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p> We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way \u2014 for example, the set of all word pairs [Formula: see text] where [Formula: see text] is a prefix of [Formula: see text] independently of what the alphabet is. Current software systems of formal language objects do not have a mechanism to define such objects. We define transducers in which transition labels involve what we call set specifications, some of which are alphabet invariant. In fact, we give a more broad definition of automata-type objects, called labelled graphs, where each transition label can be any string, as long as that string represents a subset of a certain monoid. Then, the behavior of the labelled graph is a subset of that monoid. We do the same for regular expressions. We obtain extensions of a few classic algorithmic constructions on ordinary regular expressions and transducers at the broad level of labelled graphs and in such a way that the computational efficiency of the extended constructions is not sacrificed. For transducers with set specs we obtain further algorithms that can be applied to questions about independent regular languages as well as a decision question about synchronous transducers. <\/jats:p>","DOI":"10.1142\/s0129054120420010","type":"journal-article","created":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:59:04Z","timestamp":1609207144000},"page":"983-1019","source":"Crossref","is-referenced-by-count":2,"title":["Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels"],"prefix":"10.1142","volume":"31","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[{"name":"Mathematics and Computing Science, Saint Mary\u2019s University, 923 Robie Str., Halifax, Nova Scotia BH 3C3, Canada"}]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[{"name":"CMUP & DCC, Faculdade de Ci\u00eancias da Universidade do Porto, Rua do Campo Alegre 4169-007 Porto, Portugal"}]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[{"name":"CMUP & DCC, Faculdade de Ci\u00eancias da Universidade do Porto, Rua do Campo Alegre 4169-007 Porto, Portugal"}]},{"given":"Joshua","family":"Young","sequence":"additional","affiliation":[{"name":"Mathematics and Computing Science, Saint Mary\u2019s University, 923 Robie Str., Halifax, Nova Scotia BH 3C3, Canada"}]}],"member":"219","published-online":{"date-parts":[[2020,12,28]]},"reference":[{"key":"S0129054120420010BIB001","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/11605157_3","volume-title":"Proc. CIAA 2005, Sydney, Australia","volume":"3845","author":"Abdulla P. A.","year":"2006"},{"issue":"2","key":"S0129054120420010BIB002","first-page":"117","volume":"8","author":"Allauzen C.","year":"2003","journal-title":"J. Automata, Languages and Combinatorics"},{"issue":"1","key":"S0129054120420010BIB003","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0304-3975(01)00214-6","volume":"292","author":"B\u00e9al M.-P.","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"S0129054120420010BIB004","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/PGEC.1963.263416","volume":"12","author":"Brzozowski J. A.","year":"1963","journal-title":"IEEE Trans. Electron. Comput."},{"key":"S0129054120420010BIB005","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-02737-6_13","volume-title":"Proc. DLT 2009","volume":"5583","author":"Carton O.","year":"2009"},{"key":"S0129054120420010BIB006","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-319-08846-4_12","volume-title":"Proc. CIAA 2014","volume":"8587","author":"Demaille A.","year":"2014"},{"key":"S0129054120420010BIB008","first-page":"278","volume":"8","author":"Konstantinidis S.","year":"2002","journal-title":"J. Universal Comput. Sci."},{"key":"S0129054120420010BIB009","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-319-60252-3_4","volume-title":"Proc. DCFS 2017","volume":"10316","author":"Konstantinidis S.","year":"2017"},{"key":"S0129054120420010BIB010","volume-title":"Introduction to Algorithms: A Creative Approach","author":"Manber U.","year":"1989"},{"key":"S0129054120420010BIB011","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"Sakarovitch J.","year":"2009"},{"key":"S0129054120420010BIB013","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0087133","volume-title":"S\u00e9minaire d\u2019Alg\u00e8bre Paul Dubreil, Paris 1975\u20131976 (29\u00e8me Ann\u00e9e)","volume":"586","author":"Shyr H. J.","year":"1977"},{"key":"S0129054120420010BIB014","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"Thompson K.","year":"1968","journal-title":"Commun. ACM (CACM)"},{"key":"S0129054120420010BIB015","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-642-39274-0_3","volume-title":"Proc. CIAA 2013","volume":"7982","author":"Veanes M.","year":"2013"},{"key":"S0129054120420010BIB016","first-page":"137","volume-title":"Proc. 39th ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, POPL 2012","author":"Veanes M.","year":"2012"},{"key":"S0129054120420010BIB017","volume-title":"Theory of Computation","author":"Wood D.","year":"1987"},{"key":"S0129054120420010BIB018","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages, Vol. I","author":"Yu S.","year":"1997"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120420010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T03:33:32Z","timestamp":1611200012000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120420010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":16,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.1142\/S0129054120420010"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120420010","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}