On rational solution of the state equation of a finite automaton (Q1102747)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4051008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On rational solution of the state equation of a finite automaton |
scientific article; zbMATH DE number 4051008 |
Statements
On rational solution of the state equation of a finite automaton (English)
0 references
1988
0 references
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.
0 references
GF(2)
0 references
finite automaton
0 references
rational solution
0 references
lexicographical Gödel numbers
0 references
ultimately periodic set
0 references
state equation
0 references
0.78876793384552
0 references
0.7671905755996704
0 references
