Decision questions on integer matrices

: Harju T

: 2002

Lecture Notes in Computer Science

DEVELOPMENTS IN LANGUAGE THEORY

: LECT NOTES COMPUT SC

: 2295

: 57

: 68

: 12

: 3-540-43453-4

: 0302-9743

We give a survey of simple undecidability results and open problems concerning matrices of low order with integer entries. Connections to the theory of finite automata (with multiplicities) are also provided.

Mathematics