{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:39Z","timestamp":1725492399930},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_22","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"228-232","source":"Crossref","is-referenced-by-count":6,"title":["A Package TESTAS for Checking Some Kinds of Testability"],"prefix":"10.1007","author":[{"given":"A. N.","family":"Trahtman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"22_CR1","first-page":"63","volume":"372","author":"D. Beauquier","year":"1989","unstructured":"D. Beauquier, J.E. Pin, Factors of words, Lect. Notes in Comp. Sci., 372(1989), 63\u201379.","journal-title":"Sci."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J.A. Brzozowski","year":"1973","unstructured":"J.A. Brzozowski, I. Simon, Characterizations of locally testable events, Discrete Math. 4(1973), 243\u2013271.","journal-title":"Discrete Math"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"P. Caron, LANGAGE: A Maple package for automaton characterization of regular languages, Springer, Lect. Notes in Comp. Sci., 1436(1998), 46\u201355.","DOI":"10.1007\/BFb0031380"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0304-3975(98)00332-6","volume":"242","author":"P. Caron","year":"2000","unstructured":"P. Caron, Families of locally testable languages, Theoret. Comput. Sci., 242(2000), 361\u2013376.","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","volume":"12","author":"J.M. Camparnaud","year":"1991","unstructured":"J.M. Camparnaud, G. Hansel, Automate, a computing package for automata and finite semigroups, J. of Symbolic Comput., 12(1991), 197\u2013220.","journal-title":"J. of Symbolic Comput."},{"key":"22_CR6","unstructured":"G. Cousineau, J.F. Perrot, J.M. Rifflet, APL programs for direct computation of a finite semigroup, APL Congress 73, Amsterdam, North Holl. Publ., (1973) 67\u201374."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"V. Froidure, J.-E. Pin, Algorithms for computing finite semigroups. F. Cucker and M. Shub eds., Foundations of Comp. Math. (1997), 112\u2013126.","DOI":"10.1007\/978-3-642-60539-0_9"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(99)00108-5","volume":"246","author":"P. Garcia","year":"2000","unstructured":"P. Garcia, Jose Ruiz, Right and left locally testable languages, Theoret. Comput. Sci., 246(2000), 253\u2013264.","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/12.93741","volume":"40","author":"S. Kim","year":"1991","unstructured":"S. Kim, R. McNaughton, R. McCloskey, A polynomial time algorithm for the local testability problem of deterministic finite automata, IEEE Trans. Comput., N10, 40(1991) 1087\u20131093.","journal-title":"IEEE Trans. Comput."},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-54967-6_69","volume":"560","author":"S. Kim","year":"1991","unstructured":"S. Kim, R. McNaughton, Computing the order of a locally testable automaton, Lect. Notes in Comp. Sci., 560(1991) 186\u2013211.","journal-title":"Lect. Notes in Comp. Sci."},{"issue":"3","key":"22_CR11","first-page":"233","volume":"19","author":"R. K\u00f6nig","year":"1985","unstructured":"R. K\u00f6nig, Reduction algorithm for some classes of aperiodic monoids, R.A.I.R.O. Theor.Inform., 19, 3(1985), 233\u2013260.","journal-title":"R.A.I.R.O. Theor.Inform."},{"key":"22_CR12","unstructured":"E. Leiss, Regpack, an interactive package for regular languages and finite automata, Research report CS-77-32, Univ. of Waterloo, 1977."},{"key":"22_CR13","volume-title":"Inst. inf. und pract. math.","author":"O. Matz","year":"1995","unstructured":"O. Matz, A. Miller, A. Pottho., W. Thomas, E. Valkema, Report on the program AMoRE, Inst. inf. und pract. math., Christian-Albrecht Univ. Kiel, 1995."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"R. McNaughton, Algebraic decision procedure for local testability, Math. Syst. Theory, 8( 1974), 60\u201376.","journal-title":"Math. Syst. Theory"},{"key":"22_CR15","volume-title":"Counter-free automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton, S. Papert, Counter-free automata, M.I.T. Press Mass., (1971)."},{"key":"22_CR16","unstructured":"A. Okhotin, Whale Calf, a parser generator for conjunctive grammars. 7-th Int. Conf. on Impl. and Appl. of Automata, CIAA2002, Tours, 2002, 211\u2013216."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"D. Raymond","year":"1994","unstructured":"D. Raymond, D. Wood, Grail, a C++ library for automata and expressions, J. of Symb. Comp., 17(1994) 341\u2013350.","journal-title":"J. of Symb. Comp."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"I. Simon, Piecewise testable events, Lect. Notes in Comp. Sci., 33(1975), 214\u2013222.","DOI":"10.1007\/3-540-07407-4_23"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J. Stern","year":"1985","unstructured":"J. Stern, Complexity of some problems from the theory of automata. Inf. and Control, 66(1985), 163\u2013176.","journal-title":"Inf. and Control"},{"key":"22_CR20","first-page":"78","volume":"2","author":"K. Sutner","year":"1991","unstructured":"K. Sutner, Finite State Mashines and Syntactic Semigroups, The Mathematica J., 2(1991), 78\u201387.","journal-title":"The Mathematica J."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF02572744","volume":"27","author":"A.N. Trahtman","year":"1983","unstructured":"A.N. Trahtman, The varieties of testable semigroups. Semigroup Forum, 27, (1983), 309\u2013318.","journal-title":"Semigroup Forum"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1142\/S0218196799000035","volume":"9","author":"A.N. Trahtman","year":"1998","unstructured":"A.N. Trahtman, A polynomial time algorithm for local testability and its level. Int. J. of Algebra and Comp., vol. 9, 1(1998), 31\u201339.","journal-title":"Int. J. of Algebra and Comp."},{"issue":"11","key":"22_CR23","doi-asserted-by":"publisher","first-page":"5405","DOI":"10.1080\/00927879908826762","volume":"27","author":"A.N. Trahtman","year":"1999","unstructured":"A.N. Trahtman, Identities of locally testable semigroups. Comm. in Algebra, v. 27, 11(1999), 5405\u20135412.","journal-title":"Comm. in Algebra"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(99)00191-7","volume":"235","author":"A.N. Trahtman","year":"2000","unstructured":"A.N. Trahtman, Algorithms finding the order of local testability of deterministic finite automaton and estimation of the order, Th. Comp. Sci., 235(2000), 183\u2013204.","journal-title":"Th. Comp. Sci."},{"key":"22_CR25","unstructured":"A.N. Trahtman, Piecewise and local threshold testability of DFA. Lect. Notes in Comp. Sci., 2138(2001), 347\u2013358."},{"key":"22_CR26","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-45526-4_15","volume":"2214","author":"A.N. Trahtman","year":"2001","unstructured":"A.N. Trahtman, An algorithm to verify local threshold testability of deterministic finite automata. Lect. Notes in Comp. Sci., 2214(2001), 164\u2013173.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"22_CR27","unstructured":"B.W. Watson, The design and implementation of the FIRE Engine: A C++ toolkit for Finite Automata and Regular Expressions, Comp. Sci. Rep. 94722, Endhoven Univ. of Techn. 1994."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:23:29Z","timestamp":1556900609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}