On families recognizable by finite branching automata
Václav Benda, Kamila Bendová · Czech digital mathematics library · 1977
On Families Recognizable by Finite Branching AutomataVÁCLAV BENDA, KAMILA BENDOVÁ Various topics concerning families of languages recognizable by recently introduced finite branching automata are investigated.The attention is paid to questions with answers similar to results from the "classical" automata theory, e.g.characterization of recognizable family by means of finite number of regular languages or its algebraic decomposition (cf.Section 3 and 4), as well as to questions with different answers, e.g. the class of all recognizable families is not closed under union and complement (cf.Section 2).Moreover, some results are presented which have no natural counterpart in the classical theory, e.g. about infinite cardinalities, about strong and well-recognizable families (cf.Section 3 and 5).*) Some of the results of this paper were presented at the MFCS'76 Symposium in Gdansk (cf.[2]).**) Some other results of this character appeared also in another paper [3].***) We tacitly use the continuum hypothesis.