Author:
Muchnik An.,Semenov A.,Ushakov M.
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Decidability Problems and the Constructive Models;Ershov,1980
2. Maschinenerzeugte 0-1-Folgen;Jacobs,1970
3. S. Kakutani, Ergodic theory of shift transformations, Proc. V. Berkely Simp. Prob. Stat., Vol. II, part 2, 1967, p. 407–414.
4. Generalized Morse sequences;Keane;Z. Wahrseheinlichkeitstheorie verw. Geb. Bd,1968
5. R. Loos, Computing in algebraic extensions, Compting (Suppl.4) (1982) 173–187.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. The Power of Positivity;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem;String Processing and Information Retrieval;2023
4. What’s decidable about linear loops?;Proceedings of the ACM on Programming Languages;2022-01-12
5. Rate of convergence in the disjunctive chaos game algorithm;Chaos: An Interdisciplinary Journal of Nonlinear Science;2022-01