Abstract

It is an open problem, suggested by Papert and McNaughton, to find a decision procedure for determining whether a regular event is locally testable. In this paper we provide a partial solution, giving two effectively decidable conditions, one necessary and one sufficient, for local testability. Our proofs are for the most part algebraic, using machine decompositions and semigroup theory.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call