@article{oai:nagoya.repo.nii.ac.jp:00030863, author = {Sugino, Kazue and Inagaki, Yasuyoshi and Fukumura, Teruo}, issue = {1}, journal = {Memoirs of the Faculty of Engineering, Nagoya University}, month = {Oct}, note = {In this paper we introduce a probabilistic tree automaton by extending the notion of a tree automaton. Let A be a probabilistic tree automaton and RT(A;λ) be a congruence relation defined by a tree language T(A;λ) which a probabilistic tree automaton A accepts with a cut-point λ, 0≤λ<1. We prove that if λ is an isolated cut-point then the number of equivalence classes of RT(A;λ) is finite, that is, T(A;λ) is regular.}, pages = {139--148}, title = {Tree language accepted by probabilistic tree automaton with isolated cut-point}, volume = {34}, year = {1982} }