{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:27Z","timestamp":1759637547805},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00246-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"155-175","source":"Crossref","is-referenced-by-count":14,"title":["An algebraic characterization of deterministic regular languages over infinite alphabets"],"prefix":"10.1016","volume":"306","author":[{"given":"Nissim","family":"Francez","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00246-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(80)90050-5","article-title":"Langages des alphabets infinis","volume":"2","author":"Autebert","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(03)00246-9_BIB2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00288970","article-title":"Formes de langages et de grammaries","volume":"17","author":"Autebert","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(03)00246-9_BIB3","doi-asserted-by":"crossref","unstructured":"M. Bielecki, J. Hidders, J. Paredaens, J. Tyszkiewicz, J. Van den Bussch, Navigating with a browser, in: P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Proc. 29th Internat. Colloq. on Automata, Languages and Programming\u2014ICALP 2002, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 764\u2013775.","DOI":"10.1007\/3-540-45465-9_65"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB4","doi-asserted-by":"crossref","unstructured":"B. Bolling, M. Leucker, t. Noll, Generalized regular MSA languages, Technical Report, Department of Computer Science, Aachen University of Technology, 2002.","DOI":"10.1007\/3-540-45931-6_5"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s002360050120","article-title":"Context-free languages over infinite alphabets","volume":"35","author":"Cheng","year":"1998","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(03)00246-9_BIB6","series-title":"Algebraic Theory of Automata","author":"Ginzburg","year":"1968"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB7","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB8","doi-asserted-by":"crossref","unstructured":"J. Itd, Automates a pile sur des alphabets infinis, in: Proc. Symp. of Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 166, Springer, Berlin, 1984, pp. 260\u2013273.","DOI":"10.1007\/3-540-12920-0_24"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB9","doi-asserted-by":"crossref","unstructured":"M. Kaminski, N. Francez, Finite-memory automata, in: Proc. 31th Annu. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitis, CA, 1990, pp. 683\u2013688.","DOI":"10.1109\/FSCS.1990.89590"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB10","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","article-title":"Finite-memory automata","volume":"138","author":"Kaminski","year":"1994","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB11","series-title":"Proc. 26th Internat. Symp. on Mathematical Foundations of Computer Science","first-page":"560","article-title":"Towards regular languages over infinite alphabets","volume":"Vol. 2136","author":"Neven","year":"2001"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0166-218X(85)90039-3","article-title":"Classes of regular and context-free languages over countably infinite alphabets","volume":"12","author":"Otto","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(03)00246-9_BIB13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0304-3975(03)00246-9_BIB14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","article-title":"Intractability of decision problems for finite-memory automata","volume":"231","author":"Sakamoto","year":"2000","journal-title":"Theoret. Comp. Sci. A"},{"key":"10.1016\/S0304-3975(03)00246-9_BIB15","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1006\/inco.1994.1085","article-title":"Finite-state unification automata and relational languages","volume":"114","author":"Shemesh","year":"1994","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T19:54:10Z","timestamp":1584647650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503002469"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00246-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}