Work

On rational solution of the state equation of a finite automaton

Year: 1987

Type: article

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.

Source: International Journal of Mathematics and Mathematical Sciences

DOI: 10.1155/s0161171288000420

Authors: R. Chaudhuri, H. Höft

Institution: Eastern Michigan University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,240

OpenAlex ID: W1974481916