A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
TRANSITION GRAPHS OF ITERATIONS OF INITIAL (2, 2)-AUTOMATA
2017
Науковий вісник Ужгородського університету. Серія: Математика і інформатика
Preserved Fulltext
The iterations of an automaton A naturally produces a sequence of nite graphs GA(n) which describe the transitions in A(n) = A ◦ A ◦ . . . ◦ A (n times). We consider combinatorial properties of the graphs GA(n) for initial invertible automata with two states over the binary alphabet. We compute the chromatic number and girth of the graphs GA(n) and show that all of them are imbalance graphic.
doi:10.24144/2616-7700.2017.2(31).129-136
doaj:3dc28129bade4644a069f7bde2879e47
fatcat:kxbg646jmnbb7kseoplfjmikom