On rational solution of the state equation of a finite automaton
1988 ◽
Vol 11
(2)
◽
pp. 355-364
Keyword(s):
We prove that the necessary and sufficient condition for the state equation of a finite automatonMto have a rational solution is that the lexicographical Gödel numbers of the strings belonging to each of the end-sets ofMform an ultimately periodic set. A method of determining the existence of a rational solution of the state equation is also given.
1996 ◽
Vol 33
(01)
◽
pp. 211-216
◽
2011 ◽
Vol 20
(07)
◽
pp. 1171-1182
◽
1988 ◽
Vol 30
(1)
◽
pp. 69-78
2017 ◽
Vol E100.A
(12)
◽
pp. 2764-2775
◽