Sciweavers

31 search results - page 1 / 7
» Cobham's theorem for substitutions
Sort
View
CORR
2010
Springer
71views Education» more  CORR 2010»
13 years 4 months ago
Cobham's theorem for substitutions
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
Fabien Durand
ICALP
2007
Springer
13 years 8 months ago
A Generalization of Cobham's Theorem to Automata over Real Numbers
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
Bernard Boigelot, Julien Brusten
TPHOL
2007
IEEE
13 years 10 months ago
Formalising Generalised Substitutions
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...
Jeremy E. Dawson
KBSE
2009
IEEE
13 years 11 months ago
Service Substitution Revisited
The current state of the art concerning the problem of service substitution raises the following issue: the complexity of the substitution process scales up with the number of ava...
Dionysis Athanasopoulos, Apostolos Zarras, Val&eac...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 4 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...