{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:02Z","timestamp":1709826662730},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0890-5401(03)00038-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:13:10Z","timestamp":1051132390000},"page":"137-162","source":"Crossref","is-referenced-by-count":45,"title":["An algebraic approach to data languages and timed languages"],"prefix":"10.1016","volume":"182","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00038-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(80)90050-5","article-title":"Langages sur des alphabets infinis","volume":"2","author":"Autebert","year":"1980","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB2","series-title":"Proceedings of the 12th IEEE Symposium on Logic in Computer Science (LICS\u201997)","first-page":"160","article-title":"A Kleene theorem for timed automata","author":"Asarin","year":"1997"},{"issue":"2","key":"10.1016\/S0890-5401(03)00038-5_BIB3","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/506147.506151","article-title":"Timed regular expressions","volume":"49","author":"Asarin","year":"2002","journal-title":"Journal of the Association for Computing Machinery (JACM)"},{"issue":"2","key":"10.1016\/S0890-5401(03)00038-5_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoretical Computer Science (TCS)"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB5","series-title":"Proceedings of the 6th International Conference on Computer Aided Verification (CAV\u201994)","first-page":"1","article-title":"A determinizable class of timed automata","volume":"vol. 818","author":"Alur","year":"1994"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB6","series-title":"Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control (HSCC\u201998)","first-page":"1","article-title":"Equations on timed languages","volume":"vol. 1386","author":"Asarin","year":"1998"},{"issue":"1","key":"10.1016\/S0890-5401(03)00038-5_BIB7","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"Journal of Computer and Systems Science (JCSS)"},{"issue":"2","key":"10.1016\/S0890-5401(03)00038-5_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","article-title":"A logical characterization of data languages","volume":"84","author":"Bouyer","year":"2002","journal-title":"Information Processing Letters (IPL)"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB9","series-title":"Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP\u201999)","first-page":"210","article-title":"Decomposition and composition of timed automata","volume":"vol. 1644","author":"Bouyer","year":"1999"},{"issue":"2","key":"10.1016\/S0890-5401(03)00038-5_BIB10","first-page":"167","article-title":"A Kleene\/B\u00fcchi-like theorem for clock languages","volume":"7","author":"Bouyer","year":"2002","journal-title":"Journal of Automata, Languages and Combinatorics (JALC)"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB11","series-title":"Proceedings of the 12th International Conference on Concurrency Theory (CONCUR\u201901)","first-page":"248","article-title":"An algebraic characterization of data and timed languages","volume":"vol. 2154","author":"Bouyer","year":"2001"},{"issue":"4","key":"10.1016\/S0890-5401(03)00038-5_BIB12","first-page":"371","article-title":"Timed automata with periodic clock constraints","volume":"5","author":"Choffrut","year":"2000","journal-title":"Journal of Automata, Languages and Combinatorics (JALC)"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB13","series-title":"Model-Checking","author":"Clarke","year":"1999"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB14","series-title":"Proceedings of the 9th International Conference on Concurrency Theory (CONCUR\u201998)","first-page":"455","article-title":"Controlled timed automata","volume":"vol. 1466","author":"Demichelis","year":"1998"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB15","series-title":"Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP\u201995)","first-page":"417","article-title":"The expressive power of clocks","volume":"vol. 944","author":"Henzinger","year":"1995"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB16","series-title":"Proceedings of the 8th Structure in Complexity Theory Conference (CoCo)","first-page":"200","article-title":"On the power of polynomial time bit-reductions","author":"Hertrampf","year":"1993"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB17","series-title":"Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u201998)","first-page":"580","article-title":"The regular real-time languages","volume":"vol. 1443","author":"Henzinger","year":"1998"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB18","unstructured":"J.A. Kamp, Tense logic and the theory of linear order, Ph.D. thesis, UCLA, Los Angeles, CA, USA, 1968"},{"issue":"2","key":"10.1016\/S0890-5401(03)00038-5_BIB19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","article-title":"Finite-memory automata","volume":"134","author":"Kaminski","year":"1994","journal-title":"Theoretical Computer Science (TCS)"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB20","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB21","series-title":"Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201901)","first-page":"560","article-title":"Towards regular languages over infinite alphabets","volume":"vol. 2136","author":"Neven","year":"2001"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB22","series-title":"Varieties of Formal Languages","author":"Pin","year":"1986"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB23","series-title":"Handbook of Formal Languages","year":"1997"},{"issue":"2","key":"10.1016\/S0890-5401(03)00038-5_BIB24","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"8","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Information and Control"},{"key":"10.1016\/S0890-5401(03)00038-5_BIB25","series-title":"Proceedings of the 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT\u201994)","first-page":"694","article-title":"Specifying timed state sequences in powerful decidable logics and timed automata","volume":"vol. 863","author":"Wilke","year":"1994"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000385?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000385?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:23:36Z","timestamp":1553405016000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0890540103000385"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00038-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}