Reference : Structure of the minimal automaton of a numeration language
Scientific congresses and symposiums : Paper published in a book
Physical, chemical, mathematical & earth Sciences : Mathematics
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/64873
Structure of the minimal automaton of a numeration language
English
Charlier, Emilie mailto [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Rampersad, Narad [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Rigo, Michel mailto [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Waxweiler, Laurent [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Aug-2010
Actes de LaCIM 2010
Yes
No
International
LaCIM 2010
from 29-8-2010 to 31-8-2010
Montreal
Canada
[en] Automata ; Numeration ; Structure
[en] We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component and the form of any such additional components. Our characterization applies, in particular, to any automaton arising from a Bertrand numeration system. Furthermore, we show that for any automaton A arising from a system with a dominant root beta>1, there is a morphism mapping A onto the automaton arising from the Bertrand system associated with the number beta.
Researchers
http://hdl.handle.net/2268/64873

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
lacim.pdfAuthor postprint163.6 kBView/Open

Additional material(s):

File Commentary Size Access
Open access
LaCIM 2010-Structure of the minimal automaton of a numeration language.pdfslides de la communication239.35 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.