{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:14:11Z","timestamp":1648962851415},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00191-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:48:11Z","timestamp":1027604891000},"page":"183-204","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order"],"prefix":"10.1016","volume":"235","author":[{"given":"A.N.","family":"Trahtman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00191-7_BIB1","series-title":"The Design and Analisys of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(99)00191-7_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","article-title":"Characterizations of locally testable events","volume":"4","author":"Brzozowski","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB3","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1109\/PGEC.1966.264264","article-title":"About some properties of definite, reverse-definite and related automata","volume":"EC-15","author":"Ginzburg","year":"1966","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB4","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BFb0031380","article-title":"LANGAGE: a maple package for automaton characterization of regular languages","volume":"1436","author":"Caron","year":"1998","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB5","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-51859-2_7","article-title":"An upper bound for the order of locally testable deterministic finite automaton","volume":"401","author":"Kim","year":"1989","journal-title":"Lect. Notes Comput. Sci."},{"issue":"10","key":"10.1016\/S0304-3975(99)00191-7_BIB6","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/12.93741","article-title":"A polynomial time algorithm for the local testability problem of deterministic finite automata","volume":"40","author":"Kim","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB7","doi-asserted-by":"crossref","unstructured":"S. Kim, R. McNaughton, Computing the Order of a Locally Testable Automaton, Lecture. Notes Computer Science, Vol. 560, Springer, Berlin, 1991, pp. 186\u2013211.","DOI":"10.1007\/3-540-54967-6_69"},{"key":"10.1016\/S0304-3975(99)00191-7_BIB8","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/S0097539791216987","article-title":"Computing the order of a locally testable automaton","volume":"23","author":"Kim","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB9","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/S0304-3975(99)00191-7_BIB10","unstructured":"S.W. Margolis, J.E. Pin, Languages and Inverse Semigroups, Lecture Notes Computer Science, Vol. 199, Springer, Berlin, 1985, pp. 285\u2013299."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB11","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0304-3975(99)00191-7_BIB12","series-title":"Perceptrons","author":"Minsky","year":"1971"},{"issue":"1-2","key":"10.1016\/S0304-3975(99)00191-7_BIB13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01897107","article-title":"Regular locally testable semigroups as semigroups of quasi-ideals","volume":"36","author":"Pastijn","year":"1980","journal-title":"Acta Math. Hung."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB14","first-page":"1","article-title":"Finite semigroups and recognizable languages. An introduction, Semigroups and formal languages","volume":"466","author":"Pin","year":"1995","journal-title":"Math. Philos. Sci."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/PGEC.1963.263534","article-title":"The theory of definite automata","volume":"EC-12","author":"Perles","year":"1963","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02572744","article-title":"The varieties of n-testable semigroups","volume":"27","author":"Trahtman","year":"1983","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0304-3975(99)00191-7_BIB18","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BFb0031393","article-title":"A precise estimation of the order of local testability of a deterministic finite automaton","volume":"1436","author":"Trahtman","year":"1998","journal-title":"Lect. Notes Computer Sci."},{"key":"10.1016\/S0304-3975(99)00191-7_BIB19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF02572893","article-title":"Locally testable semigroups","volume":"5","author":"Zalcstein","year":"1973","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0304-3975(99)00191-7_BIB20","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","article-title":"Locally testable languages","volume":"6","author":"Zalcstein","year":"1972","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001917?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001917?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:00:56Z","timestamp":1556506856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599001917"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00191-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}