Automata and automatic sequences

12/17/2022
by   Jean-Paul Allouche, et al.
0

In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless to say, we feel that the order we propose is the most natural one. References appear at the end of each one of the parts which implies some redundancy. Extra references are listed at the very end of our paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2020

Descriptive Set Theory and ω-Powers of Finitary Languages

The ω-power of a finitary language L over a finite alphabet Σ is the lan...
research
04/11/2021

Dissecting the square into seven or nine congruent parts

We give a computer-based proof of the following fact: If a square is div...
research
04/13/2018

Constructive Analysis of S1S and Büchi Automata

We study S1S and Büchi automata in the constructive type theory of the C...
research
04/06/2023

Magic numbers in periodic sequences

In formal languages and automata theory, the magic number problem can be...
research
04/07/2021

Finite Automata Encoding Functions

Finite automata are used to describe functions, geometric figures, fract...
research
03/27/2019

Generic properties in some classes of automaton groups

We prove, for various important classes of Mealy automata, that almost a...
research
10/20/2020

Human-Paraphrased References Improve Neural Machine Translation

Automatic evaluation comparing candidate translations to human-generated...

Please sign up or login with your details

Forgot password? Click here to reset