{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:13:08Z","timestamp":1770909188513,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,3,1]],"date-time":"1974-03-01T00:00:00Z","timestamp":131328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1974,3]]},"DOI":"10.1007\/bf01761708","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T19:25:19Z","timestamp":1118863519000},"page":"60-76","source":"Crossref","is-referenced-by-count":101,"title":["Algebraic decision procedures for local testability"],"prefix":"10.1007","volume":"8","author":[{"given":"Robert","family":"McNaughton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01761708_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J. A. Brzozowski","year":"1973","unstructured":"J. A. Brzozowski andI. Simon, Characterizations of locally testable events,Discrete Mathematics 4 (1973), 243\u2013271.","journal-title":"Discrete Mathematics"},{"key":"BF01761708_CR2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"N. Chomsky andM. P. Sch\u00fctzenberger, The algebraic theory of context-free languages, inComputer Programming and Formal Systems (P. Braffort and D. Hirschberg, editors), North Holland, Amsterdam, 1963, pp. 118\u2013161."},{"key":"BF01761708_CR3","unstructured":"L. S. Levy andM. Freeman, Finitely generated events, unpublished paper, 1970."},{"key":"BF01761708_CR4","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton andS. Papert,Counter-free Automata, M.I.T. Press, Cambridge, Mass., 1971."},{"key":"BF01761708_CR5","unstructured":"Yu. T. Medvedev, On the class of events representable in a finite automaton (translated from the Russian), inSequential Machines\u2014Selected Papers (E. F. Moore, ed.), Addison-Wesley, 1964, pp. 215\u2013227."},{"key":"BF01761708_CR6","first-page":"233","volume":"EC-12","author":"M. Perles","year":"1963","unstructured":"M. Perles, M. O. Rabin andE. Shamir, The theory of definite automata,Trans. IEEE EC-12 (1963), 233\u2013243.","journal-title":"Trans. IEEE"},{"key":"BF01761708_CR7","first-page":"338","volume":"30","author":"F. P. Ramsey","year":"1928","unstructured":"F. P. Ramsey, On a problem of formal logic,Proc. London Math. Soc.,30 (Ser. 2, 1928), Part 4, 338\u2013384. Reprinted in a paperback,The Foundations of Mathematics and other Logical Essays, by F. P. Ramsey, Littlefield, Adams and Co., Patterson, N. J., 1960. (This book was first printed by Routledge and Kegan Paul, London, 1931).","journal-title":"Proc. London Math. Soc."},{"key":"BF01761708_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y. Zalcstein","year":"1972","unstructured":"Y. Zalcstein, Locally testable languages,J. Computer Systems Science 6 (1972), 151\u2013167.","journal-title":"J. Computer Systems Science"},{"key":"BF01761708_CR9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF02572893","volume":"5","author":"Y. Zalcstein","year":"1973","unstructured":"Y. Zalcstein, Locally testable semigroups,Semigroup Forum 5 (1973), 216\u2013227.","journal-title":"Semigroup Forum"},{"key":"BF01761708_CR10","first-page":"135","volume-title":"Proc. International Symposium on Theory of Automata, Languages and Programming (IRIA, Paris)","author":"Y. Zalcstein","year":"1972","unstructured":"Y. Zalcstein, Syntactic semigroups of some classes of star-free languages,Proc. International Symposium on Theory of Automata, Languages and Programming (IRIA, Paris), North Holland Publishing Company, Amsterdam, 1972, pp. 135\u2013144."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01761708.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01761708\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01761708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:41:39Z","timestamp":1557333699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01761708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,3]]}},"alternative-id":["BF01761708"],"URL":"https:\/\/doi.org\/10.1007\/bf01761708","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,3]]}}}