default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorges Hansel
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j13]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16(5): 851-865 (2005)- [j12]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Similarity relations and cover automata. RAIRO Theor. Informatics Appl. 39(1): 115-123 (2005) - 2004
- [j11]Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin:
Unavoidable Sets of Constant Length. Int. J. Algebra Comput. 14(2): 241-251 (2004) - [j10]Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi:
Random Generation Models for NFAs. J. Autom. Lang. Comb. 9(2/3): 203-216 (2004) - [c8]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Reducing Cover Subsequential Transducers. DCFS 2004: 131-144 - 2002
- [c7]Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi:
NFAs bitstream-based random generation. DCFS 2002: 81-94
1990 – 1999
- 1998
- [j9]Georges Hansel:
Systèmes de numération indépendants et syndéticité. Theor. Comput. Sci. 204(1-2): 119-130 (1998) - 1997
- [j8]Véronique Bruyère, Georges Hansel:
Bertrand Numeration Systems and Recognizability. Theor. Comput. Sci. 181(1): 17-43 (1997) - 1995
- [c6]Véronique Bruyère, Georges Hansel:
Recognizable Sets of Numbers in Nonstandard Bases. LATIN 1995: 167-179 - 1992
- [c5]Georges Hansel, Dominique Perrin, Imre Simon:
Compression and Entropy. STACS 1992: 515-528 - 1991
- [j7]Jean-Marc Champarnaud, Georges Hansel:
AUTOMATE, a Computing Package for Automata and Finite Semigroups. J. Symb. Comput. 12(2): 197-220 (1991) - [c4]Georges Hansel, Daniel Krob, Christian Michaux
:
Stochastic Automata and Length Distributions of Rational Languages. MFCS 1991: 181-190
1980 – 1989
- 1989
- [j6]Georges Hansel, Dominique Perrin:
Rational Probability Measures. Theor. Comput. Sci. 65(2): 171-188 (1989) - 1987
- [c3]Georges Hansel:
Estimation of the Entropy by the Lempel-Ziv Method. Electronic Dictionaries and Automata in Computational Linguistics 1987: 51-65 - 1986
- [j5]Georges Hansel:
Une Démonstration Simple du Théorème de Skolem-Mahler-Lech. Theor. Comput. Sci. 43: 91-98 (1986) - [j4]François Blanchard, Georges Hansel:
Systèmes Codés. Theor. Comput. Sci. 44: 17-49 (1986) - 1985
- [c2]Georges Hansel:
A Simple Proof of the Skolem-Mahler-Lech Theorem. ICALP 1985: 244-249 - 1984
- [c1]François Blanchard, Georges Hansel:
Languages and subshifts. Automata on Infinite Words 1984: 138-146 - 1983
- [j3]Georges Hansel, Dominique Perrin:
Codes and Bernoulli Partitions. Math. Syst. Theory 16(2): 133-157 (1983) - 1982
- [j2]Georges Hansel:
Baionnettes et cardinaux. Discret. Math. 39(3): 331-335 (1982)
1970 – 1979
- 1972
- [j1]Georges Hansel:
Complexes et Décompositions Binomiales. J. Comb. Theory A 12(2): 167-183 (1972)
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 2024-06-10 20:32 CEST 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:
