On the final coalgebra of automatic sequences

Authors:
Clemens Kupke;Jan J. M. M. Rutten
Affiliations:
University of Oxford, UK;Centrum Wiskunde & Informatica (CWI), The Netherlands,Radboud University Nijmegen, The Netherlands
Venue:
Logic and Program Semantics
Year:
2012

Citing 5
Cited 1

Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Automata and Coinduction (An Exercise in Coalgebra)

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
A coinductive calculus of streams

Mathematical Structures in Computer Science
Complete sets of cooperations

Information and Computation

Linearization of Automatic Arrays and Weave Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Streams are omnipresent in both mathematics and theoretical computer science. Automatic sequences form a particularly interesting class of streams that live in both worlds at the same time: they are defined in terms of finite automata, which are basic computational structures in computer science; and they appear in mathematics in many different ways, for instance in number theory. Examples of automatic sequences include the celebrated Thue-Morse sequence and the Rudin-Shapiro sequence. In this paper, we apply the coalgebraic perspective on streams to automatic sequences. We show that the set of automatic sequences carries a final coalgebra structure, consisting of the operations of head, even, and odd. This will allow us to show that automatic sequences are to (general) streams what rational languages are to (arbitrary) languages.