On the complexity of recurring sequences

DOI10.1515/156939203322109122MaRDI QIDQ4809616zbMATH OpenOpenAlexFDO

Authors S. S. Marchenkov

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203322109122

zbMATH Keywords

brachingcomplexityrecurring sequence

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Undecidability and degrees of sets of sentences (03D35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Cited in

(11)

• Composition of recursions and nonlinear complexity of periodic binary sequences
• On the complexity of monitoring Orchids signatures, and recurrence equations
• On the complexity of polynomial recurrence sequences
• Complexity of Hartman sequences
• On recurrences on the streams
• scientific article; zbMATH DE number 3890728 (Why is no real title available?)
• Multiple Recurrence and Finding Patterns in Dense Sets
• Return time complexity of Sturmian sequences
• The complexity of Fibonacci-like kneading sequences
• On polynomial-modular recursive sequences
• Near-polynomial recursive sequences with algorithmically unsolvable problems

This page was built for publication: On the complexity of recurring sequences

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