{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:03:21Z","timestamp":1760061801632},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8021,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/s0747-7171(08)80125-3","type":"journal-article","created":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T09:59:32Z","timestamp":1214387972000},"page":"197-220","source":"Crossref","is-referenced-by-count":32,"title":["AUTOMATE, a computing package for automata and finite semigroups"],"prefix":"10.1016","volume":"12","author":[{"given":"J.M.","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Hansel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80125-3_bib1","series-title":"The design and analysis of computer algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/S0747-7171(08)80125-3_bib2","article-title":"Algorithmes d\u2019analyse des automates finis et applications aux probl\u00e8mes de synchronisation","author":"Alaiwan","year":"1983","journal-title":"Th\u00e8se de S\u00e8me cycle \u00e0 l\u2019Universit\u00e9 Paris VU"},{"key":"10.1016\/S0747-7171(08)80125-3_bib3","first-page":"35","article-title":"Codage, automates locaux et entropie","author":"Beal","year":"1988","journal-title":"Th\u00e8se \u00e0 l\u2019Universit\u00e9 Paris VII, Rapport L.I.T.P."},{"key":"10.1016\/S0747-7171(08)80125-3_bib4","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/S0747-7171(08)80125-3_bib5","first-page":"85","article-title":"AUTOMATE: Un syst\u00e8me de manipulation des automates finis","author":"Champarnaud","year":"1985","journal-title":"Rapport L.I.T.P."},{"key":"10.1016\/S0747-7171(08)80125-3_bib6","first-page":"44","article-title":"La commande automate, Manuel de l\u2019utilisateur","author":"Champarnaud","year":"1988","journal-title":"Rapport L.I.T.P."},{"key":"10.1016\/S0747-7171(08)80125-3_bib7","article-title":"La commande mono\u00efde, Manuel de l\u2019utilisateur","author":"Champarnaud","year":"1988","journal-title":"Rapport L.I.T.P. 88-45bis"},{"key":"10.1016\/S0747-7171(08)80125-3_bib8","unstructured":"Cousineau, G., J.F. Perrot and J.M. Rifflet, APL for direct computation of finite semigroups, Actes du congr\u00e8s APL 73, North Holland Publ. Comp."},{"key":"10.1016\/S0747-7171(08)80125-3_bib9","series-title":"Automata, Languages, and Machines","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0747-7171(08)80125-3_bib10","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/322326.322327","article-title":"The compilation of regular expressions into integrated circuits","volume":"29","author":"Floyd","year":"1982","journal-title":"JACM"},{"key":"10.1016\/S0747-7171(08)80125-3_bib11","article-title":"Introduction to automata theory, languages and computation","author":"Hopcroft","year":"1979","journal-title":"Addison-Wesley"},{"key":"10.1016\/S0747-7171(08)80125-3_bib12","first-page":"90","article-title":"A Short Guide to the AMORE System","author":"Jansen","year":"1990","journal-title":"Aachener Informatik-Berichte Nr."},{"key":"10.1016\/S0747-7171(08)80125-3_bib13","series-title":"INR: A Program for Computing Finite Automata","author":"Johnson","year":"1984"},{"key":"10.1016\/S0747-7171(08)80125-3_bib14","article-title":"Structuring the Text of the Oxford English Dictionary through Finite State Transduction","author":"Kazman","year":"1986","journal-title":"Thesis at the University of Waterloo"},{"key":"10.1016\/S0747-7171(08)80125-3_bib15","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956","journal-title":"Automata Studies"},{"key":"10.1016\/S0747-7171(08)80125-3_bib16","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/S0747-7171(08)80125-3_bib17","series-title":"Research report CS-77-32","article-title":"Regpack, an interactive package for regular languages and finite automata","author":"Leiss","year":"1977"},{"key":"10.1016\/S0747-7171(08)80125-3_bib18","article-title":"Lex, A Lexical Analyzer Generator","volume":"39","author":"Lesk","year":"1975"},{"key":"10.1016\/S0747-7171(08)80125-3_bib19","series-title":"Counter-Free Automata","author":"McNaughton","year":"1972"},{"key":"10.1016\/S0747-7171(08)80125-3_bib20","article-title":"Utilisation d\u2019APL pour calculer des mono\u00efdes finis","author":"Perrot","year":"1972","journal-title":"Institut de Programmation de Paris VI"},{"key":"10.1016\/S0747-7171(08)80125-3_bib21","series-title":"Vari\u00e9t\u00e9s de langages formels","author":"Pin","year":"1984"},{"key":"10.1016\/S0747-7171(08)80125-3_bib22","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BFb0029007","article-title":"New results on the generalized star-height problem","volume":"LNCS 349","author":"Pin","year":"1989","journal-title":"STACS 89"},{"key":"10.1016\/S0747-7171(08)80125-3_bib23","article-title":"The Non-deterministic Complexity of a Finite Automaton","author":"Simon","year":"1987","journal-title":"Instituto de Matem\u00e1tica e stat\u00edstica, Universidade de S\u00e3o Paulo, RT-MAP-8703"},{"key":"10.1016\/S0747-7171(08)80125-3_bib24","first-page":"419","article-title":"Regular expression search algorithm","volume":"11","author":"Thomson","year":"1968","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/S0747-7171(08)80125-3_bib25","unstructured":"Weil, P. Inverse monoids of dot-depth two, \u00e0 para\u00eftre in Theoretical Computer Science."},{"issue":"5","key":"10.1016\/S0747-7171(08)80125-3_bib26","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"volume IT-24","author":"Ziv","year":"1978","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T16:57:37Z","timestamp":1545929857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108801253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["S0747717108801253"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80125-3","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}