Mathematics

Computability in Multidimensional Symbolic Dynamics

Author: 
E. Jeandel
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Multidimensional Symbolic Dynamics is the extension to Z2 and Zn of
(classical) symbolic dynamics.
We are still interested in shifts of finite type, sofic shifts, and factor
maps (among others).

Notes: 
PDF icon JeandelE- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

Characterizing possible typical asymptotic behaviours of cellular automata

Author: 
Benjamin Hellouin de Menibus
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Characterizing possible typical asymptotic behaviours of cellular automata

Notes: 
PDF icon HellouindeMinibusB & SablikB- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

k-block versus 1-block parallel addition in non-standard numeration systems

Author: 
Christiane Frougny
Pavel Heller
Edita Pelantova
Milena Svobodova
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

k-block versus 1-block parallel addition in
non-standard numeration systems

Notes: 
PDF icon HellerP- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

µ - Equicontinuity and weak convergence in zero-dimensional spaces

Author: 
Felipe García-Ramos
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

µ - Equicontinuity and weak convergence in zero-dimensional spaces

Notes: 
PDF icon Garcia-RamosF- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

Entropy of tree automata, joint spectral radii and zero-error coding

Author: 
Catalin Dima
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Entropy of trees & tree automata.
Entropy of tree automata = joint spectral radius.
The zero-error coding problem with states.
Approximating zero-error capacities of codes.
Open problems, etc.

Notes: 
PDF icon DimaC- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

A categorical invariant of flow equivalence of shifts

Author: 
Alfredo Costa
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

A categorical invariant of flow equivalence of shifts

Notes: 
PDF icon CostaA- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

Markov Random Fields and the Pivot Property

Author: 
Nishant Chandgotia
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Markov Random Fields and the Pivot Property

Notes: 
PDF icon ChandgotiaN- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

Markov diagrams for some non-Markovian systems

Author: 
Kathleen Carroll
Karl Petersen
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Markov diagrams for some non-Markovian systems

Notes: 
PDF icon CarrollK & PetersenK- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

Pisot numeration systems and beyond

Author: 
V. Berthé
W. Steiner
J. Thuswaldner
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Pisot numeration systems and beyond

Notes: 
PDF icon BertheV- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

A maximal entropy stochastic process for a timed automaton

Author: 
Nicolas Basset
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Theoretical problem statement
Lift the Shannon/Parry Markov chain of a strongly connected
finite graph to the timed automata settings.
(aka MME of an irreducible SFT)
Practical problem statement
Generate quickly and as uniformly as possible runs of a timed
automaton.
◮ quickly: Step by step simulation as with a finite state Markov
Chain → Stochastic Process Over Runs (SPOR)
◮ ≈ uniformly → SPOR of maximal entropy + asymptotic
equipartition property.

Notes: 
PDF icon BassetN- Automata.pdf
Class: 
Scientific
Subject: 
Mathematics

Pages