Abstract
This chapter focuses on the recognizers (Rabin-Scott automata). A deterministic automaton is a special case of a nondeterministic one; hence, a set of tapes recognized by a deterministic automaton is recognized by a nondeterministic one. The chapter also shows that the opposite is also true. Various theorems are proved in the chapter. Various examples of regular and non-regular sets are presented. A reduced automaton is one which has no proper homomorphic images, provided that its input set is held constant. Every semiautomaton with more than one state has a proper homomorphic image: the one-state semi-automaton. The regular sets corresponding to an automaton and to its homomorphic image are equal.
Sign-in/Register to access full text options 
Free) 
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
