Decidability and \(k\)-regular sequences

DOI10.1016/j.tcs.2022.01.018OpenAlexW4205209914MaRDI QIDQ2077376

Daniel Krenn, Jeffrey O. Shallit

Publication date: 21 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09507

zbMATH Keywords

decidabilityunsolvability\(k\)-regular sequence

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ A height gap theorem for coefficients of Mahler functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• The ring of \(k\)-regular sequences
• On finite semigroups of matrices
• La finitude des représentations linéaires des semi-groupes est decidable
• Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
• Handbook of computability theory
• The boundedness of all products of a pair of matrices is undecidable
• Quasi-universal \(k\)-regular sequences
• Effective procedures in field theory
• Decidabilite de la finitude des demi-groupes de matrices
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Uniform tag sequences

This page was built for publication: Decidability and \(k\)-regular sequences