Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Frougny, Christiane"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
k
-block parallel addition versus 1-block parallel addition in non-standard numeration systems
Christiane Frougny
,
Pavel Heller
,
Edita Pelantová
,
Milena Svobodová
Theoretical Computer Science
543
, 2014, pp. 52-67
Parallel addition in non-standard numeration systems
Christiane Frougny
,
Edita Pelantová
,
Milena Svobodová
Theoretical Computer Science
412
(41), 2011, pp. 5714-5727
On alpha-adic expansions in Pisot bases
Petr Ambroz̑
,
Christiane Frougny
Theoretical Computer Science
380
(3), 2007, pp. 238-250
Arithmetic Meyer sets and finite automata
Shigeki Akiyama
,
Frédérique Bassino
,
Christiane Frougny
Information and Computation
201
(2), 2005, pp. 199-215
Symmetry groups for beta-lattices
Avi Elkharrat
,
Christiane Frougny
,
Jean-Pierre Gazeau
,
Jean-Louis Verger-Gaugry
Theoretical Computer Science
319
(1-3), 2004, pp. 281-305
Additive and multiplicative properties of point sets based on beta-integers
Christiane Frougny
,
Jean-Pierre Gazeau
,
Rudolf Krejcar
Theoretical Computer Science
303
(2-3), 2003, pp. 491-516
On-line digit set conversion in real base
Christiane Frougny
Theoretical Computer Science
292
(1), 2003, pp. 221-235
On-line addition in real base
Christiane Frougny
Lecture Notes in Computer Science
1672
, 1999, pp. 1-11
Synchronisation déterministe des automates à délai borné
Christiane Frougny
,
Jacques Sakarovitch
Theoretical Computer Science
191
(1-2), 1998, pp. 61-77
On the sequentiality of the successor function
Christiane Frougny
Information and Computation
139
(1), 1997, pp. 17-38
On the successor function in non-classical numeration systems
Christiane Frougny
Lecture Notes in Computer Science
1046
, 1996, pp. 543-553
Parallel and on-line addition in negative base and some complex number systems
Christiane Frougny
Lecture Notes in Computer Science
1124
, 1996, pp. 175-182
Computability by finite automata and Pisot bases
Daniel Berend
,
Christiane Frougny
Math. Systems Theory
27
(3), 1994, pp. 275-282
Synchronized rational relations of finite and infinite words
Christiane Frougny
,
Jacques Sakarovitch
Theoretical Computer Science
108
, 1993, pp. 45-82
How to write integers in non-integer base
Christiane Frougny
Lecture Notes in Computer Science
583
, 1992, pp. 154-164
Systèmes de numération linéaires et
\Theta
-représentations
Christiane Frougny
Theoretical Computer Science
94
, 1992, pp. 223-236
Representations of numbers and finite automata
Christiane Frougny
Math. Systems Theory
25
, 1992, pp. 37-60
Confluent linear numeration systems
Christiane Frougny
Theoretical Computer Science
106
, 1992, pp. 183-219
Rational relations with bounded delay
Christiane Frougny
,
Jacques Sakarovitch
Lecture Notes in Computer Science
480
, 1991, pp. 50-63
Linear numeration systems,
\Theta
-developments and finite automata
Christiane Frougny
Lecture Notes in Computer Science
349
, 1989, pp. 144-155
Linear numerations systems of order two
Christiane Frougny
Information and Computation
77
(3), 1988, pp. 233-259
Context-free grammars with cancellation properties
Christiane Frougny
Theoretical Computer Science
39
(1), 1985, pp. 3-13