Georges Hansel

According to our database1, Georges Hansel authored at least 21 papers between 1972 and 2005.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2005
Similarity relations and cover automata.
RAIRO Theor. Informatics Appl., 2005

Cover transducers for functions with finite domain.
Int. J. Found. Comput. Sci., 2005

2004
Random Generation Models for NFAs.
J. Autom. Lang. Comb., 2004

Unavoidable Sets of Constant Length.
Int. J. Algebra Comput., 2004

Reducing Cover Subsequential Transducers.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2002
NFAs bitstream-based random generation.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

1998
Systèmes de numération indépendants et syndéticité.
Theor. Comput. Sci., 1998

1997
Bertrand Numeration Systems and Recognizability.
Theor. Comput. Sci., 1997

1995
Recognizable Sets of Numbers in Nonstandard Bases.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1992
Compression and Entropy.
Proceedings of the STACS 92, 1992

1991
AUTOMATE, a Computing Package for Automata and Finite Semigroups.
J. Symb. Comput., 1991

Stochastic Automata and Length Distributions of Rational Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1989
Rational Probability Measures.
Theor. Comput. Sci., 1989

1987
Estimation of the Entropy by the Lempel-Ziv Method.
Proceedings of the Electronic Dictionaries and Automata in Computational Linguistics, 1987

1986
Une Démonstration Simple du Théorème de Skolem-Mahler-Lech.
Theor. Comput. Sci., 1986

Systèmes Codés.
Theor. Comput. Sci., 1986

1985
A Simple Proof of the Skolem-Mahler-Lech Theorem.
Proceedings of the Automata, 1985

1984
Languages and subshifts.
Proceedings of the Automata on Infinite Words, 1984

1983
Codes and Bernoulli Partitions.
Math. Syst. Theory, 1983

1982
Baionnettes et cardinaux.
Discret. Math., 1982

1972
Complexes et Décompositions Binomiales.
J. Comb. Theory, Ser. A, 1972


  Loading...