Publisher
Springer International Publishing
Reference18 articles.
1. Ambainis, A., Beaudry, M., Golovkins, M., Ķikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. Theory Comput. Syst. 39(1), 165–188 (2006)
2. Ambainis, A., Yakaryılmaz, A.: Automata and quantum computing. CoRR, abs/1507.0:1–32 (2015)
3. Lecture Notes in Computer Science;A Díaz-Caro,2016
4. Evertse, J.-H.: On sums of S-units and linear recurrences. Compositio Math. 53(2), 225–244 (1984)
5. Hansel, G.: A simple proof of the Skolem-Mahler-Lech theorem. Theoret. Comput. Sci. 43(1), 91–98 (1986)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exclusive Affine Languages;Baltic Journal of Modern Computing;2022
2. Error-Free Affine, Unitary, and Probabilistic OBDDs;International Journal of Foundations of Computer Science;2021-05-12
3. Computational limitations of affine automata and generalized affine automata;Natural Computing;2021-01-18
4. Improved Constructions for Succinct Affine Automata;Descriptional Complexity of Formal Systems;2021
5. Affine Automata Verifiers;Unconventional Computation and Natural Computation;2021