Publications récentes sous format électronique

M. Brzicová, Ch. Frougny, E. Pelantová, and M. Svobodová. On-line algorithms for multiplication and division in real and complex numeration systems, arXiv 1610.08309, Oct. 2016.

M. Brzicová, Ch. Frougny, E. Pelantová, and M. Svobodová. On-line multiplication and division in real and complex bases, in Proceedings of IEEE ARITH 23, I.E.E.E. Computer Society Press (2016).

Ch. Frougny and E. Pelantová. Beta-representations of 0 and Pisot numbers, arXiv 1512.04234, Dec. 2015.

Ch. Frougny, P. Heller, E. Pelantová, and M. Svobodová. k-block parallel addition versus 1-block parallel addition in non-standard numeration systems, Theoretical Computer Science, 543 (2014), 52-67.

Ch. Frougny, P. Heller, E. Pelantov\xe1, and M. Svobodov\xe1. Parallel algorithms for addition in non-standard number systems, ITA San Diego, (2014), 1-7.

Ch. Frougny and K. Klouda. Factor and palindromic complexity of Thue-Morse's avatars, Acta Polytechnica, 53(6) (2013), 868-871.

C. Ahlbach, J. Usatine, Ch. Frougny, and N. Pippenger. Efficient Algorithms for Zeckendorf Arithmetic, Fibonacci Quaterly, 51(3) (2013), 249-255.

Ch. Frougny, E. Pelantová, and M. Svobodová. Minimal Digit Sets for Parallel Addition in Non-Standard Numeration Systems, Journal of Integer Sequences, 16 (2013), Article 13.2.17.

C. Epifanio, Ch. Frougny, A. Gabriele, F. Mignosi and J. Shallit. Sturmian graphs and integer representations over numeration systems, Discrete Applied Mathematics, 160 (2012), 536-547.

Ch. Frougny and K. Klouda. Rational base number systems for p-adic numbers, R.A.I.R.O. Theoretical Informatics and Applications, 46 (2012), 87-106; doi:10.1051/ita/2011114 (2011).

Ch. Frougny, E. Pelantová, and M. Svobodová. Parallel addition in non-standard numeration systems, Theoretical Computer Science, 412 (2011), 5714-5727.

Ch. Frougny and A.C. Lai. Negative bases and automata, Discrete Mathematics and Theoretical Computer Science, 13 (1) (2011), 75-94.

Ch. Frougny and K. Klouda. Rational base number systems for p-adic numbers, Proceedings of 13-th Mons Theoretical Computer Science Days (2010).

C. Epifanio, Ch. Frougny, A. Gabriele, F. Mignosi and J. Shallit. On lazy representations and Sturmian graphs, Proceedings of CIAA 2010.

Ch. Frougny and J. Sakarovitch. Number representation and finite automata, Chapter 2 in Combinatorics, Automata and Number Theory, V. Berthé, M. Rigo (Eds), Encyclopedia of Mathematics and its Applications 135, Cambridge University Press (2010).

B. Adamczewski, Ch. Frougny, A. Siegel and W. Steiner. Rational numbers with purely periodic beta-expansion, Bull. Lond. Math. Soc. 42(3) (2010), 538-552.

Ch. Frougny and A.C. Lai. On negative bases, Proceedings of DLT 09, Lectures Notes in Computer Science, 5583 (2009) 252-263.

J.-P. Allouche and Ch. Frougny. Univoque numbers and an avatar of Thue-Morse, Acta Arithmetica, 136 (2009), 319-329.

Ch. Frougny and W. Steiner. Minimal weight expansions in Pisot bases, Journal of Mathematical Cryptology, 2 (2008) 365-392.

S. Akiyama, Ch. Frougny and J. Sakarovitch. Powers of rationals modulo 1 and rational base number systems, Israël J. Math., 168 (2008) 53-91.

V. Berthé, Ch. Frougny, M. Rigo, J. Sakarovitch. On the cost and complexity of the successor function, in: P. Arnoux, N. Bédaride, and J. Cassaigne (Eds.), Proc. WORDS 2007, Tech. Rep., Institut de mathématiques de Luminy (Marseille), 2007, pp. 43--56, extended abstract.

Ch. Frougny and W. Steiner. Minimal weight expansions in some Pisot bases, Proceedings of AutoMathA 2007, extended abstract.

P. Ambroz and Ch. Frougny. On alpha-adic expansions in Pisot bases, Theoretical Computer Science, 380 (2007) 238-250.

J.-P. Allouche, Ch. Frougny, and K. Hare. On univoque Pisot numbers, Mathematics of Computation, 76 (2007) 1639-1660.

Ch. Frougny. Non-standard number representation: computer arithmetic, beta-numeration and quasicrystals, in Physics and Theoretical Computer Science, J.-P. Gazeau, J. Nesestril and B. Rovan eds., IOS Press, 2007.

Ch. Frougny, Z. Masŕkovŕ, and E. Pelantovŕ. Infinite special branches in words associated with beta-expansions, Discrete Mathematics and Theoretical Computer Science, 9:2 (2007) 125-144.

P. Ambroz, Ch. Frougny, Z. Masŕkovŕ, and E. Pelantovŕ. Palindromic complexity of infinite words associated with simple Parry numbers, Ann. Inst. Fourier, 56 (2006) 2131-2160.

S. Akiyama, Ch. Frougny and J. Sakarovitch. On the representation of numbers in a rational base, Proceedings of Words 2005, (S. Brlek et Ch. Reutenauer, eds.), Monographies du LaCIM 36 UQaM, Montréal, Canada (2005) 47-64.

G. Barat, Ch. Frougny, and A. Pethoe. A Note on Linear Recurrent Mahler Numbers, INTEGERS, Volume 5(3) (2005) A1.

S. Akiyama, F. Bassino, and Ch. Frougny. Arithmetic Meyer sets and finite automata, Information and Computation, 201 (2005) 199-215.

A. Elkharrat and Ch. Frougny. Voronoi cells of beta-integers, Proceedings of DLT 05, Lectures Notes in Computer Science, 3572 (2005) 209-223.

Ch. Frougny and L. Vuillon. Coding of two-dimensional constraints of finite type by substitutions J. Aut. Lang. Comb., 10, No. 4 (2005) 465-482.

Ch. Frougny, Z. Masŕkovŕ, and E. Pelantovŕ. Complexity of infinite words associated with beta-expansions, R.A.I.R.O. Theoretical Informatics and Applications, 38 (2004) 163-185. Corrigendum, R.A.I.R.O. Theoretical Informatics and Applications, 38 (2004) 269-271.

A. Elkharrat, Ch. Frougny, J.P. Gazeau, and J.-L. Verger-Gaugry. Symmetry groups for beta-lattices, Theoretical Computer Science, 319 (2004) 281-305.

P. Ambroz, Ch. Frougny, Z. Masŕkovŕ, and E. Pelantovŕ. Arithmetics on number systems with irrational bases Bull. Belgian Math. Soc. Simon Stevin, 10 (2003) 641-659.

Ch. Frougny and A. Surarerks. On-line multiplication in real and complex base, Proceedings of IEEE ARITH 16, I.E.E.E. Computer Society Press (2003) 212-219. LIAFA research report.

Ch. Frougny. On-line odometers for two-sided symbolic dynamical systems, Proceedings of DLT 2002, Lecture Notes in Computer Science, 2450 (2002) 405-416.

Ch. Frougny, J.P. Gazeau, and R. Krejcar. Additive and multiplicative properties of point sets based on beta-integers, Theoretical Computer Science, 303 (2003) 491-516.

Ch. Frougny. On-line digit set conversion in real base, Theoretical Computer Science 292 (2003) 221-235.

Ch. Frougny and J. Sakarovitch. Two groups associated with quadratic Pisot units, Internat. J. Algebra Comput. 12 (2002) 825-848.

Ch. Frougny. On multiplicatively dependent linear numeration systems, and periodic points, R.A.I.R.O. Theoretical Informatics and Applications 36 (2002) 293-314.

Ch. Frougny. Conversion between two multiplicatively dependent linear numeration systems, Proceedings of LATIN 02, Lectures Notes in Computer Science 2286 (2002) 64-75.

Ch. Frougny. Numeration systems, Chapter 7 in M. Lothaire, Algebraic Combinatorics on words. Cambridge University Press, 2002.

C. Burdik, Ch. Frougny, J.P. Gazeau, and R. Krejcar. Beta-integers as a group, in Dynamical Systems: From Crystal to Chaos, World Scientific (2000) 125-136.

Ch. Frougny. On-the-Fly Algorithms and Sequential Machines, IEEE Transactions on Computers 49 (2000) 859-863.

Ch. Frougny. On-line addition in real base, Proceedings of MFCS 1999, Lectures Notes in Computer Science 1672 (1999) 1-11.

Ch. Frougny. On-line finite automata for addition in some numeration systems, R.A.I.R.O. Theoretical Informatics and Applications 33 (1999) 79-101.

Ch. Frougny and J. Sakarovitch. Automatic conversion from Fibonacci representation to representation in base phi, and a generalization, Internat. J. Algebra Comput. 9 (1999) 351-384.

Ch. Frougny and B. Solomyak. On the context-freeness of the theta-expansions of the integers, Internat. J. Algebra Comput. 9 (1999) 347-350.

C. Burdik, Ch. Frougny, J.P. Gazeau, and R. Krejcar. Beta-integers as natural counting systems for quasicrystals, J. of Physics A: Math. Gen. 31 (1998) 6449-6472.

Ch. Frougny. On the sequentiality of the successor function, Inform. and Computation 139 (1997) 17-38.


Copyright notice

Material on this page is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.