Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Christiane Frougny
2010 – today
- 2012
[j40]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: Sturmian graphs and integer representations over numeration systems. Discrete Applied Mathematics 160(4-5): 536-547 (2012)
[j39]Christiane Frougny, Karel Klouda: Rational base number systems for p-adic numbers. RAIRO - Theor. Inf. and Applic. 46(1): 87-106 (2012)- 2011
[j38]Christiane Frougny, Anna Chiara Lai: Negative bases and automata. Discrete Mathematics & Theoretical Computer Science 13(1): 75-94 (2011)
[j37]Christiane Frougny, Edita Pelantová, Milena Svobodová: Parallel addition in non-standard numeration systems. Theor. Comput. Sci. 412(41): 5714-5727 (2011)
[i3]Christiane Frougny, Edita Pelantová, Milena Svobodová: Parallel addition in non-standard numeration systems. CoRR abs/1102.5683 (2011)- 2010
[c17]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134
[i2]
2000 – 2009
- 2009
[c16]Christiane Frougny, Anna Chiara Lai: On Negative Bases. Developments in Language Theory 2009: 252-263- 2008
[j36]Christiane Frougny, Wolfgang Steiner: Minimal weight expansions in Pisot bases. J. Mathematical Cryptology 2(4): 365-392 (2008)
[i1]Christiane Frougny, Wolfgang Steiner: Minimal weight expansions in Pisot bases. CoRR abs/0803.2874 (2008)- 2007
[j35]Christiane Frougny, Zuzana Masáková, Edita Pelantová: Infinite Special Branches in Words Associated with Beta-Expansions. Discrete Mathematics & Theoretical Computer Science 9(2) (2007)
[j34]
[j33]Jean-Paul Allouche, Christiane Frougny, Kevin G. Hare: On univoque Pisot numbers. Math. Comput. 76(259): 1639-1660 (2007)
[j32]Petr Ambroz, Christiane Frougny: On alpha-adic expansions in Pisot bases. Theor. Comput. Sci. 380(3): 238-250 (2007)- 2005
[j31]Shigeki Akiyama, Frédérique Bassino, Christiane Frougny: Arithmetic Meyer sets and finite automata. Inf. Comput. 201(2): 199-215 (2005)
[j30]Christiane Frougny, Laurent Vuillon: Coding of Two-Dimensional Constraints of Finite Type by Substitutions. Journal of Automata, Languages and Combinatorics 10(4): 465-482 (2005)
[c15]Avi Elkharrat, Christiane Frougny: Voronoi Cells of Beta-Integers. Developments in Language Theory 2005: 209-223- 2004
[j29]Christiane Frougny, Zuzana Masáková, Edita Pelantová: Complexity of infinite words associated with beta-expansions. ITA 38(2): 163-185 (2004)
[j28]Christiane Frougny, Zuzana Masáková, Edita Pelantová: Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions. ITA 38(3): 269-271 (2004)
[j27]Avi Elkharrat, Christiane Frougny, Jean-Pierre Gazeau, Jean-Louis Verger-Gaugry: Symmetry groups for beta-lattices. Theor. Comput. Sci. 319(1-3): 281-305 (2004)
[c14]Shigeki Akiyama, Frédérique Bassino, Christiane Frougny: Automata for Arithmetic Meyer Sets. LATIN 2004: 252-261- 2003
[j26]Christiane Frougny, Jean-Pierre Gazeau, Rudolf Krejcar: Additive and multiplicative properties of point sets based on beta-integers. Theor. Comput. Sci. 2-3(303): 491-516 (2003)
[j25]Peter Kornerup, Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller: Preface. Theor. Comput. Sci. 291(2): 133-134 (2003)
[j24]Christiane Frougny: On-line digit set conversion in real base. Theor. Comput. Sci. 292(1): 221-235 (2003)
[c13]Christiane Frougny, Athasit Surarerks: On-Line Multiplication in Real and Complex Base. IEEE Symposium on Computer Arithmetic 2003: 212-219- 2002
[j23]Christiane Frougny, Jacques Sakarovitch: Two Groups Associated with Quadratic Pisot Units. IJAC 12(6): 825-847 (2002)
[j22]Christiane Frougny: On multiplicatively dependent linear numeration systems, and periodic points. ITA 36(3): 293-314 (2002)
[j21]Jean Marie Chesneaux, Christiane Frougny, Jean-Michel Muller: Real Numbers - Foreword. Theor. Comput. Sci. 279(1-2): 1-2 (2002)
[c12]Christiane Frougny: On-Line Odometers for Two-Sided Symbolic Dynamical Systems. Developments in Language Theory 2002: 405-416
[c11]Christiane Frougny: Conversion between Two Multiplicatively Dependent Linear Numeration Systems. LATIN 2002: 64-75- 2000
[j20]Christiane Frougny: On-the-Fly Algorithms and Sequential Machines. IEEE Trans. Computers 49(8): 859-863 (2000)
1990 – 1999
- 1999
[j19]Christiane Frougny, Boris Solomyak: On the Context-Freeness of the θ-expansions of the Integers. IJAC 9(3-4): 347-350 (1999)
[j18]Christiane Frougny, Jacques Sakarovitch: Automatic Conversion from Fibonacci Representation to Representation in Base φ, and a Generalization. IJAC 9(3-4): 351-384 (1999)
[j17]Christiane Frougny: On-line finite automata for addition in some numeration systems. ITA 33(1): 79-101 (1999)
[j16]Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller: Foreword: Real Numbers and Computers. Theor. Comput. Sci. 210(1): 1-2 (1999)
[c10]
[c9]Christiane Frougny, Jacques Sakarovitch: A Rewrite System Associated with Quadratic Pisot Units. RTA 1999: 356-370- 1998
[j15]Christiane Frougny, Jacques Sakarovitch: Synchronisation déterministe des automates à délai borné. Theor. Comput. Sci. 191(1-2): 61-77 (1998)- 1997
[j14]Christiane Frougny: On the Sequentiality of the Successor Function. Inf. Comput. 139(1): 17-38 (1997)
[c8]Christiane Frougny: On-the-Fly Algorithms and Sequential Machines. IEEE Symposium on Computer Arithmetic 1997: 260-265- 1996
[j13]Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller, Gilles Villard: Forword to the Special Issue on Real Numbers and Computers. Theor. Comput. Sci. 162(1): 1-3 (1996)
[c7]Christiane Frougny: Parallel and On-Line Addition in Negative Base and Some Complex Number Systems. Euro-Par, Vol. II 1996: 175-182
[c6]Christiane Frougny: On the Successor Function in Non-Classical Numeration Systems. STACS 1996: 543-553- 1994
[j12]Daniel Berend, Christiane Frougny: Computability by Finite Automata and Pisot Bases. Mathematical Systems Theory 27(3): 275-282 (1994)- 1993
[j11]Christiane Frougny, Jacques Sakarovitch: Synchronized Rational Relations of Finite and Infinite Words. Theor. Comput. Sci. 108(1): 45-82 (1993)- 1992
[j10]Christiane Frougny: Representations of Numbers and Finite Automata. Mathematical Systems Theory 25(1): 37-60 (1992)
[j9]Christiane Frougny: Systemes de numeration linearires et Theta-representations. Theor. Comput. Sci. 94(2): 223-236 (1992)
[j8]
[c5]- 1991
[j7]Christiane Frougny: Fibonacci representations and finite automata. IEEE Transactions on Information Theory 37(2): 393-399 (1991)
[c4]Christiane Frougny: Representation of numbers in nonclassical numeration systems. IEEE Symposium on Computer Arithmetic 1991: 17-21
[c3]
1980 – 1989
- 1989
[c2]Christiane Frougny: Linear Numeration Systems, Theta-Developments and Finite Automata. STACS 1989: 144-155- 1988
[j6]- 1986
[c1]- 1985
[j5]Christiane Frougny: Context-Free Grammars with Cancellation Properties. Theor. Comput. Sci. 39: 3-13 (1985)- 1984
[j4]- 1982
[j3]Christiane Frougny, Jacques Sakarovitch, Erich Valkema: On the Hotz Group of a Context-Free Grammar. Acta Inf. 18: 109-115 (1982)- 1981
[j2]
1970 – 1979
- 1979
[j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-05 22:13 CEST by the dblp team



