FINITE AUTOMATA ON INFINITE OBJECTS
Takeshi Hayashi · Kyushu University Institutional Repository (QIR) (Kyushu University) · 1985
Infinite behaviors of several kinds of finite automata on infinite objects are studied.Namely, alternating finite automata on r0-words, finite tree automata on infinite trees which move from the root infinitely, and finite biautomata on two-sided infinite words are investigated through six types of acceptance conditions.Each condition is an appropriate extension of the one used for acceptance of finite automata on co-words.