Skip to main content
Conference Proceedings

Decidability and enumeration for automatic sequences: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7913 LNCS 49-63
DOI: 10.1007/978-3-642-38536-0_5
14Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this talk I will report on some recent results concerning decidability and enumeration for properties of automatic sequences. This is work with Jean-Paul Allouche, Émilie Charlier, Narad Rampersad, Dane Henshall, Luke Schaeffer, Eric Rowland, Daniel Goč, and Hamoon Mousavi. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Shallit, J. (2013). Decidability and enumeration for automatic sequences: A survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7913 LNCS, pp. 49–63). Springer Verlag. https://doi.org/10.1007/978-3-642-38536-0_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free