Finite Automata on Transfinite Sequences and Regular Expressions
Jerzy Wojciechowski · Fundamenta Informaticae · 1985
In this paper the notion of regular expression for finite automata on transfinite sequences /TF-automata/ is introduced. The characterization theorem for TF-automata is proved. From this theorem we conclude the decidability of the emptiness problem for TF-automata and the characterization theorem for finite automata on transfinite sequences of bounded lenght.