<--- Back to Details
First PageDocument Content
Sequence / Thue–Morse sequence / Baum–Sweet sequence / Rudin–Shapiro sequence / Monoid / Mathematics / Automata theory / Automatic sequence
Date: 2000-08-07 13:52:27
Sequence
Thue–Morse sequence
Baum–Sweet sequence
Rudin–Shapiro sequence
Monoid
Mathematics
Automata theory
Automatic sequence

Finite automata and arithmetic J.-P. Allouche 1 ∗

Add to Reading List

Source URL: www.mat.univie.ac.at

Download Document from Source Website

File Size: 210,23 KB

Share Document on Facebook

Similar Documents

Mathematical Foundations of Automata Theory ´ Jean-Eric Pin Version of June 15, 2018

DocID: 1uKeS - View Document

CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov

DocID: 1uDy7 - View Document

Theory Comput Syst DOIs00224Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

DocID: 1tED6 - View Document

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

DocID: 1tDnH - View Document

University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory

DocID: 1sU9J - View Document