Rudeanu, Sergiu Behaviouristic automata. II. The synthesis problem. (English) Zbl 0735.68062 An. Ştiinţ. Univ. Al. I. Cuza Iaşi, Ser. Nouă, Mat. 35, No. 4, Inf., 303-312 (1989). In a previous paper, the author [An. Univ. Bucureşti, Ser. Mat.-Inf. 38, No. 2, 64-71 (1989)] introduced the concept of behaviouristic automaton, which is a common generalization of Mealy automata and Rabin- Scott automata. In the present paper the synthesis problem for behaviouristic automata is introduced and solved. This yields as particular cases the construction of a Mealy automaton having a given external behaviour and the well known construction of a Rabin-Scott automaton which recognizes a given regular language. Reviewer: S.Rudeanu Cited in 2 Documents MSC: 68Q70 Algebraic theory of languages and automata 68Q45 Formal languages and automata Keywords:Mealy automaton; Rabin-Scott automaton; regular language PDFBibTeX XML