scientific article; zbMATH DE number 2087212

MaRDI QIDQ4737895zbMATH OpenFDO

Authors Tero Harju

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2295/22950057.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• On Markov's undecidability theorem for integer matrices.
• Some decision problems on integer matrices
• Mortality Problem for 2×2 Integer Matrices
• Improved matrix pair undecidability results
• Undecidability in matrices over Laurent polynomials.

Cited in

(9)

• Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
• The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
• Some decision problems on integer matrices
• Post Correspondence Problem and Small Dimensional Matrices
• Undecidability in matrices over Laurent polynomials.
• The exact complexity of the infinite Post Correspondence Problem
• Incompleteness theorems, large cardinals, and automata over finite words
• Improved matrix pair undecidability results
• On Markov's undecidability theorem for integer matrices.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737895)