Abstract
Directable automata, known also as synchronizable, cofinal and reset automata, are a significant type of automata with very interesting algebraic properties and important applications in various branches of Computer Science. The central concept that we introduce and discuss in this paper is the concept of \pi-directable automata as a concomitant specialization concept of the directable automata and generalization of the concept definite automata. Are introduced and a new class of automata, such as trapp-directable automata, the local trap \pi-directable automata, uniformly locally trap p-directable automata, finite \pi-directable automata.
Full Text
Published Version
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