期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：1988
卷号：11
DOI：10.1155/S0161171288000420
出版社：Hindawi Publishing Corporation
摘要：We prove that the necessary and sufficient condition for the state equation of a finite automaton M to have a rational solution is that the lexicographical Gödel numbers of the strings belonging to each of the end-sets of M form an ultimately periodic set. A method of determining the existence of a rational solution of the state equation is also given.
