Mortality problem and affine automata

Authors:
I. K. Rystsov
Affiliations:
National Technical University of Ukraine "Kiev Polytechnic Institute", Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2008

Citing 5
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
When is a pair of matrices mortal?

Information Processing Letters
Mortality in Matrix Semigroups

Mortality in Matrix Semigroups
Representations of Regular Ideals in Finite Automata

Cybernetics and Systems Analysis
Minimal zero words for second-order matrices

Cybernetics and Systems Analysis

Theory of general linear automata

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mortality problem for 2脳2 matrices is treated from the automata theory viewpoint. This problem is shown to be closely related to the reachability problem for linear and affine automata of low dimensions. The decidability of the reachability problem is proved for some subclasses of one-dimensional affine automata.