Logic and -recognizable sets of integers.
Bruyère, Véronique, Hansel, Georges, Michaux, Christian, Villemaire, Roger (1994)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “One dimensional dynamics and factors of finite automata”
Logic and -recognizable sets of integers.
On rational solution of the state equation of a finite automaton.
Chaudhuri, R., Höft, H. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Abstract -expansions and ultimately periodic representations
Michel Rigo, Wolfgang Steiner (2005)
Journal de Théorie des Nombres de Bordeaux
Similarity:
For abstract numeration systems built on exponential regular languages (including those coming from substitutions), we show that the set of real numbers having an ultimately periodic representation is if the dominating eigenvalue of the automaton accepting the language is a Pisot number. Moreover, if is neither a Pisot nor a Salem number, then there exist points in which do not have any ultimately periodic representation.
Corrigendum to our paper: How Expressions Can Code for Automata
Sylvain Lombardy, Jacques Sakarovitch (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
In a previous paper, we have described the construction of an automaton from a rational expression which has the property that the automaton built from an expression which is itself computed from a co-deterministic automaton by the state elimination method is co-deterministic. It turned out that the definition on which the construction is based was inappropriate, and thus the proof of the property was flawed. We give here the correct definition of the broken derived terms...
Some properties of cellular automata with equicontinuity points
F. Blanchard, P. Tisseur (2000)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
How expressions can code for automata
Sylvain Lombardy, Jacques Sakarovitch (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. We show here that if an automaton is then sufficiently “decorated”, the combination of these...