On rational solution of the state equation of a finite automaton

R. Chaudhuri and H. Höft

International Journal of Mathematics and Mathematical Sciences, 1988, vol. 11, 1-10

Abstract:

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.

Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/11/602673.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/11/602673.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:602673

DOI: 10.1155/S0161171288000420

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().