Finite Automata on Transfinite Sequences and Regular Expressions
Keyword(s):
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.
2009 ◽
Vol 2009
◽
pp. 1-10
◽
2011 ◽
Vol 22
(07)
◽
pp. 1593-1606
◽
2021 ◽
pp. 1-23
Keyword(s):
2007 ◽
Vol 17
(01)
◽
pp. 141-154
◽
2013 ◽
Vol 24
(08)
◽
pp. 1255-1279
◽
2014 ◽
Vol 25
(08)
◽
pp. 1141-1159
◽