Lowering Undecidability Bounds for Decision Questions in Matrices

DOI10.1007/11779148_34zbMath1227.03057OpenAlexW1582481528MaRDI QIDQ3617076

Paul C. Bell, Igor Potapov

Publication date: 26 March 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11779148_34

zbMATH Keywords

matrix semigroupspiecewise linear mapsmembershiptheory of computingvector reachability

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Improved matrix pair undecidability results ⋮ Orbits of Linear Maps and Regular Languages

This page was built for publication: Lowering Undecidability Bounds for Decision Questions in Matrices