default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDF. Michel Dekking
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Michel Dekking
, Michael S. Keane:
Two-block substitutions and morphic words. Adv. Appl. Math. 148: 102536 (2023)- 2021
- [j22]Jean-Paul Allouche, Michel Dekking, Martine Queffélec:
Hidden automatic sequences. Comb. Theory 1(0) (2021) - [j21]F. Michel Dekking:
The sum of digits functions of the Zeckendorf and the base phi expansions. Theor. Comput. Sci. 859: 70-79 (2021) - 2020
- [j20]F. Michel Dekking, Jeffrey O. Shallit, Neil J. A. Sloane:
Queens in Exile: Non-attacking Queens on Infinite Chess Boards. Electron. J. Comb. 27(1): 1 (2020) - [j19]Michel Dekking:
Morphic words, Beatty sequences and integer images of the Fibonacci language. Theor. Comput. Sci. 809: 407-417 (2020) - [i2]Jean-Paul Allouche, F. Michel Dekking, Martine Queffélec:
Hidden automatic sequences. CoRR abs/2010.00920 (2020)
2010 – 2019
- 2018
- [j18]Wieb Bosma, Michel Dekking, Wolfgang Steiner:
A Remarkable Integer Sequence Related to π and √2. Integers 18A: A4 (2018) - [j17]Michel Dekking:
Substitution Invariant Sturmian Words and Binary Trees. Integers 18A: A7 (2018) - [j16]Michel Dekking:
The Frobenius problem for homomorphic embeddings of languages into the integers. Theor. Comput. Sci. 732: 73-79 (2018) - 2017
- [j15]F. Michel Dekking, Michael S. Keane:
On the conjugacy class of the Fibonacci dynamical system. Theor. Comput. Sci. 668: 59-69 (2017) - 2016
- [j14]F. Michel Dekking:
Morphisms, Symbolic Sequences, and Their Standard Forms. J. Integer Seq. 19(1): 16.1.1 (2016) - [j13]E. W. Dekking, F. Michel Dekking:
Helge von Koch′s Snowflake Curve Revisited. Am. Math. Mon. 123(2): 181-184 (2016) - 2015
- [i1]F. Michel Dekking:
Pure morphic sequences and their standard forms. CoRR abs/1509.00260 (2015) - 2014
- [j12]Michel Dekking:
On the structure of Thue-Morse subwords, with an application to dynamical systems. Theor. Comput. Sci. 550: 107-112 (2014) - 2013
- [c1]Michel Dekking:
Dynamical Equivalence of Morphisms. WORDS 2013: 3 - 2012
- [j11]Michel Dekking:
Paperfolding morphisms, planefilling curves, and fractal tiles. Theor. Comput. Sci. 414(1): 20-37 (2012) - 2010
- [j10]F. Michel Dekking, Leonard van Driel, Anne Fey:
Stability in One-dimensional Random Boolean Cellular Automata. J. Cell. Autom. 5(4-5): 333-351 (2010)
2000 – 2009
- 2009
- [j9]Michel Dekking, André Hensbergen:
A Problem with the Assessment of an Iris Identification System. SIAM Rev. 51(2): 417-422 (2009) - 2008
- [j8]Michel Dekking, Károly Simon:
On the size of the algebraic difference of two random Cantor sets. Random Struct. Algorithms 32(2): 205-222 (2008)
1990 – 1999
- 1994
- [j7]F. Michel Dekking:
Iteration of maps by an automaton. Discret. Math. 126(1-3): 81-86 (1994) - [j6]T. Bedford, F. Michel Dekking, Marcel Breeuwer, Michael S. Keane, D. van Schooneveld:
Fractal coding of monochrome images. Signal Process. Image Commun. 6(5): 405-419 (1994)
1980 – 1989
- 1989
- [j5]F. Michel Dekking:
On the Probability of Occurrence of Labelled Subtrees of a Randomly Labelled Tree. Theor. Comput. Sci. 65(2): 149-152 (1989) - 1986
- [j4]F. Michel Dekking, Peter J. van Otterloo:
Fourier Coding and Reconstruction of Complicated Contours. IEEE Trans. Syst. Man Cybern. 16(3): 395-404 (1986) - 1982
- [j3]F. Michel Dekking:
Replicating Superfigures and Endomorphisms of Free Groups. J. Comb. Theory A 32(3): 315-320 (1982)
1970 – 1979
- 1979
- [j2]F. Michel Dekking:
Strongly Non-Repetitive Sequences and Progression-Free Sets. J. Comb. Theory A 27(2): 181-185 (1979) - 1976
- [j1]F. Michel Dekking:
On Repetitions of Blocks in Binary Sequences. J. Comb. Theory A 20(3): 292-299 (1976)
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-20 22:58 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:
