FINITE TREE AUTOMATA ON INFINITE TREES - Collections

＜journal article＞
FINITE TREE AUTOMATA ON INFINITE TREES

Creator	Author PID K000436 Creator Name Hayashi, Takeshi 林, 健志 Affiliation Affiliation Name College of General Education, Kyushu University 九州大学教養部
Creator	Author PID L001145 Creator Name Miyano, Satoru 宮野, 悟 Affiliation Affiliation Name Department of Mathematics, Kyushu University 九州大学数学科
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	1985-03
Source Title	Bulletin of informatics and cybernetics
Vol	21
Issue	3/4
First Page	71
Last Page	82
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/13369
Related DOI	Bulletin of informatics and cybernetics \|\| 21(3/4) \|\| p71-82
Related DOI	http://bic.math.kyushu-u.ac.jp/
Related URI	Bulletin of informatics and cybernetics \|\| 21(3/4) \|\| p71-82
Related URI	http://bic.math.kyushu-u.ac.jp/
Relation	Bulletin of informatics and cybernetics \|\| 21(3/4) \|\| p71-82
Relation	http://bic.math.kyushu-u.ac.jp/
Abstract	Finite tree automata on in finite trees which move from the root infinitely are investigated through six types of acceptance conditions. Each condition is an extension of the one used for finite autom...ata on $ omega $-words. We relate the six classes of infinite tree languages with the corresponding classes of $ omega $-languages defined by finite automata, and the relationship among these six classes is established.show more

File	FileType	Size	Views	Description
p071	pdf	761 KB	415