default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristiane Frougny
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j43]Valérie Berthé
, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. Adv. Appl. Math. 120: 102062 (2020)
2010 – 2019
- 2019
- [j42]Christiane Frougny, Marta Pavelka, Edita Pelantová, Milena Svobodová:
On-line algorithms for multiplication and division in real and complex numeration systems. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [i6]Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. CoRR abs/1907.01464 (2019) - 2016
- [c19]Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová:
On-line Multiplication and Division in Real and Complex Bases. ARITH 2016: 134-141 - [i5]Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová:
On-line algorithms for multiplication and division in real and complex numeration systems. CoRR abs/1610.08309 (2016) - 2015
- [i4]Christiane Frougny, Edita Pelantová:
Beta-representations of 0 and Pisot numbers. CoRR abs/1512.04234 (2015) - 2014
- [j41]Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová:
k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems. Theor. Comput. Sci. 543: 52-67 (2014) - [c18]Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová:
Parallel algorithms for addition in non-standard number systems. ITA 2014: 1-7 - 2012
- [j40]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit:
Sturmian graphs and integer representations over numeration systems. Discret. Appl. Math. 160(4-5): 536-547 (2012) - [j39]Christiane Frougny, Karel Klouda:
Rational base number systems for p-adic numbers. RAIRO Theor. Informatics Appl. 46(1): 87-106 (2012) - 2011
- [j38]Christiane Frougny, Anna Chiara Lai:
Negative bases and automata. Discret. Math. Theor. Comput. Sci. 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 O. Shallit:
On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134 - [i2]Christiane Frougny, Anna Chiara Lai:
Negative bases and automata. CoRR abs/1012.3721 (2010)
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. Math. Cryptol. 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. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j34]Vasco Brattka, Christiane Frougny, Norbert Th. Müller:
Foreword. RAIRO Theor. Informatics Appl. 41(1): 1-2 (2007) - [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. J. Autom. Lang. Comb. 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. RAIRO Theor. Informatics Appl. 38(2): 163-185 (2004) - [j28]Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions. RAIRO Theor. Informatics Appl. 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]Peter Kornerup, Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller:
Preface. Theor. Comput. Sci. 291(2): 133-134 (2003) - [j25]Christiane Frougny:
On-line digit set conversion in real base. Theor. Comput. Sci. 292(1): 221-235 (2003) - [j24]Christiane Frougny, Jean-Pierre Gazeau, Rudolf Krejcar:
Additive and multiplicative properties of point sets based on beta-integers. Theor. Comput. Sci. 303(2-3): 491-516 (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. Int. J. Algebra Comput. 12(6): 825-847 (2002) - [j22]Christiane Frougny:
On multiplicatively dependent linear numeration systems, and periodic points. RAIRO Theor. Informatics Appl. 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. Int. J. Algebra Comput. 9(3-4): 347-350 (1999) - [j18]Christiane Frougny, Jacques Sakarovitch:
Automatic Conversion from Fibonacci Representation to Representation in Base φ, and a Generalization. Int. J. Algebra Comput. 9(3-4): 351-384 (1999) - [j17]Christiane Frougny:
On-line finite automata for addition in some numeration systems. RAIRO Theor. Informatics Appl. 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]Christiane Frougny:
On-Line Addition in Real Base. MFCS 1999: 1-11 - [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. Math. Syst. 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. Math. Syst. 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]Christiane Frougny:
Confluent Linear Numeration Systems. Theor. Comput. Sci. 106(2): 183-219 (1992) - [c5]Christiane Frougny:
How to Write Integers in Non-Integer Base. LATIN 1992: 154-164 - 1991
- [j7]Christiane Frougny:
Fibonacci representations and finite automata. IEEE Trans. Inf. 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]Christiane Frougny, Jacques Sakarovitch:
Rational Ralations with Bounded Delay. STACS 1991: 50-63
1980 – 1989
- 1989
- [c2]Christiane Frougny:
Linear Numeration Systems, Theta-Developments and Finite Automata. STACS 1989: 144-155 - 1988
- [j6]Christiane Frougny:
Linear Numeration Systems of Order Two. Inf. Comput. 77(3): 233-259 (1988) - 1986
- [c1]Christiane Frougny:
Fibonacci Numeration Systems and Rational Functions. MFCS 1986: 350-359 - 1985
- [j5]Christiane Frougny:
Context-Free Grammars with Cancellation Properties. Theor. Comput. Sci. 39: 3-13 (1985) - 1984
- [j4]Christiane Frougny:
Grammaires Algébriques et Monoïdes Simplifiables. RAIRO Theor. Informatics Appl. 18(3): 225-239 (1984) - 1982
- [j3]Christiane Frougny, Jacques Sakarovitch, Erich Valkema:
On the Hotz Group of a Context-Free Grammar. Acta Informatica 18: 109-115 (1982) - 1981
- [j2]Christiane Frougny:
Simple Deterministic NTS Languages. Inf. Process. Lett. 12(4): 174-178 (1981)
1970 – 1979
- 1979
- [j1]Christiane Frougny:
Langages très simples générateurs. RAIRO Theor. Informatics Appl. 13(1): 69-86 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
