Decision Questions on Integer Matrices

Authors:
Tero Harju
Affiliations:
-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 10
Cited 0

A proof of Ehrenfeucht's conjecture

Theoretical Computer Science
A simple proof of the Skolem-Mahler-Lech Theorem

Theoretical Computer Science
Rational series and their languages

Rational series and their languages
The equivalence problem of multitape finite automata

Theoretical Computer Science
Morphisms

Handbook of formal languages, vol. 1
When is a pair of matrices mortal?

Information Processing Letters
Example of undecidable problems for 2-generator matrix semigroups

Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Decision Problems for Semi-Thue Systems with a Few Rules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.