Undecidability in matrices over Laurent polynomials.

DOI10.1016/J.AAM.2004.04.002zbMath1147.20315OpenAlexW2050618314MaRDI QIDQ705234

Vesa Halava, Tero J.Harju

Publication date: 26 January 2005

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2004.04.002

zbMATH Keywords

undecidabilityfinite automatafinite sets of upper triangular matricesmatrices over Laurent polynomials

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Reversal-bounded multipushdown machines
• Restricted one-counter machines with undecidable universe problems
• An Infinite Hierarchy of Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Undecidability in matrices over Laurent polynomials.