Dominique Perrin

From MaRDI portal
Person:213071

Available identifiers

zbMath Open perrin.dominiqueDBLP74/6417WikidataQ29042768 ScholiaQ29042768MaRDI QIDQ213071

List of research outcomes





PublicationDate of PublicationType
Unambiguously coded shifts2024-06-28Paper
Decidable problems in substitution shifts2024-04-09Paper
Recognizability of morphisms2023-12-15Paper
The palindromization map2023-09-14Paper
Compression and entropy2022-08-18Paper
https://portal.mardi4nfdi.de/entity/Q50724842022-04-28Paper
A note on one-sided recognizable morphisms2022-04-08Paper
Dimension Groups and Dynamical Systems2021-12-01Paper
Symbolic dynamics2021-11-12Paper
Eventually dendric shift spaces2021-06-03Paper
On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts2021-03-29Paper
Unambiguously coded shifts2021-03-01Paper
Graded alphabets, circular codes, free Lie algebras and comma-free codes2021-01-21Paper
Profinite Semigroups and Symbolic Dynamics2020-09-03Paper
Dimension Groups and Dynamical Systems2020-07-30Paper
On the group of a rational maximal bifix code2020-05-11Paper
Obituary: Aldo de Luca 1941--20182019-11-07Paper
Return words and bifix codes in eventually dendric sets2019-11-06Paper
Eventually dendric shifts2019-10-22Paper
Groups, languages and dendric shifts2018-11-22Paper
Rigidity and Substitutive Dendric Words2018-09-20Paper
Birecurrent sets2018-07-12Paper
Enumerative sequences of leaves in rational trees2018-07-04Paper
The Wadge-Wagner hierarchy of ω-rational sets2018-07-04Paper
Interval exchanges, admissibility and branching Rauzy induction2018-05-03Paper
A Survey on Difference Hierarchies of Regular Languages2018-04-25Paper
Hall sets, Lazard sets and comma-free codes2017-10-24Paper
Synchronised automata2017-10-06Paper
Specular sets2017-06-15Paper
Return words of linear involutions and fundamental groups2017-05-16Paper
Profinite semigroups2017-03-29Paper
Neutral and tree sets of arbitrary characteristic2016-12-19Paper
On the generating sequences of regular languages on k symbols2015-11-12Paper
Enumeration Formulæ in Neutral Sets2015-11-10Paper
Codes and Automata in Minimal Sets2015-11-04Paper
Specular Sets2015-11-04Paper
https://portal.mardi4nfdi.de/entity/Q29491522015-10-07Paper
Acyclic, connected and tree sets2015-03-31Paper
Bifix codes and interval exchanges2015-02-27Paper
The finite index basis property2015-02-27Paper
Maximal bifix decoding2015-01-30Paper
Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences2014-11-20Paper
A quadratic algorithm for road coloring2014-05-06Paper
Notes on sets of first return2013-08-26Paper
Completely reducible sets2013-07-30Paper
Bifix codes and Sturmian words2013-04-17Paper
Toward a Timed Theory of Channel Coding2012-11-21Paper
Generating Functions of Timed Languages2012-09-25Paper
Recent results on syntactic groups of prefix codes.2012-08-14Paper
A note on Sturmian words2012-05-30Paper
Embeddings of local automata2011-04-28Paper
A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA2011-03-30Paper
https://portal.mardi4nfdi.de/entity/Q30869222011-03-30Paper
https://portal.mardi4nfdi.de/entity/Q30621212011-01-03Paper
Codes and noncommutative stochastic matrices2010-10-07Paper
On the groups of codes with empty kernel.2010-07-06Paper
Symbolic dynamics and finite automata2010-06-17Paper
Symbolic dynamics2010-06-07Paper
Codes and automata.2009-12-21Paper
Completing codes in a sofic shift2009-10-09Paper
Gérard Lallement (1935-2006)2009-07-24Paper
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata2009-07-07Paper
Unambiguous automata2008-09-08Paper
Complete Codes in a Sofic Shift2008-03-19Paper
STACS 20042007-10-01Paper
The origins of combinatorics on words2007-03-27Paper
THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE2006-08-14Paper
Codes, unambiguous automata and sofic systems.2006-05-18Paper
A hierarchy of shift equivalent sofic shifts2005-12-06Paper
UNAVOIDABLE SETS OF CONSTANT LENGTH2005-09-27Paper
https://portal.mardi4nfdi.de/entity/Q53174192005-09-16Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Parsing with a finite dictionary2005-08-01Paper
Codes and sofic constraints2005-08-01Paper
On syntactic groups.2005-06-09Paper
A note on the Burrows-Wheeler transformation2005-04-06Paper
https://portal.mardi4nfdi.de/entity/Q47368702004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44303002003-10-20Paper
Unavoidable sets2003-07-07Paper
A weak equivalence between shifts of finite type2003-03-26Paper
https://portal.mardi4nfdi.de/entity/Q27765392002-09-11Paper
https://portal.mardi4nfdi.de/entity/Q27042252001-12-03Paper
Circular codes2001-11-06Paper
THE WAGNER HIERARCHY2000-11-07Paper
A Finite State Version of the Kraft--McMillan Theorem2000-10-18Paper
Enumerative sequences of leaves and nodes in rational trees2000-01-12Paper
Maximal bifix codes1999-06-21Paper
Chains and Superchains for ω-Rational Sets, Automata and Semigroups1999-04-20Paper
https://portal.mardi4nfdi.de/entity/Q42271191999-02-23Paper
https://portal.mardi4nfdi.de/entity/Q38389971998-10-08Paper
https://portal.mardi4nfdi.de/entity/Q43855271998-05-14Paper
https://portal.mardi4nfdi.de/entity/Q31236331997-12-07Paper
Marcel-Paul Schützenberger (1920--1996)1997-09-04Paper
https://portal.mardi4nfdi.de/entity/Q31250831997-06-16Paper
https://portal.mardi4nfdi.de/entity/Q48584621995-12-13Paper
Two-way string-matching1994-09-29Paper
Surjective Extensions of Sliding-Block Codes1994-08-14Paper
On the expressive power of temporal logic1993-08-18Paper
https://portal.mardi4nfdi.de/entity/Q40370121993-05-18Paper
On positive matrices1992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39775891992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q38176361989-01-01Paper
Rational probability measures1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47347581989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38059031988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38320631988-01-01Paper
First-order logic and star-free sets1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427431986-01-01Paper
Ensembles Reconnaissables de Mots Biinfinis1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37181741986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37144791985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37369191985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37410861985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37385861985-01-01Paper
Codeterministic automata on infinite words1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36983271984-01-01Paper
Completing biprefix codes1984-01-01Paper
Sur les monoides à un relateur qui sont des groupes1984-01-01Paper
Factorizing The Polynomial of a Code1984-01-01Paper
Codes and Bernoulli partitions1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36771891983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36688791983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33322511982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39456091982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47417171982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36670901981-01-01Paper
A conjecture on sets of differences of integer pairs1981-01-01Paper
A graph covering construction of all the finite complete biprefix codes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39017021981-01-01Paper
Sur le théorème du defaut1979-01-01Paper
Synchronization and simplification1979-01-01Paper
La représentation ergodique d'un automate fini1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41843521978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39428941978-01-01Paper
Le degré minimal du groupe d'un code biprefixe fini1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38521091977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41321091977-01-01Paper
Codes asynchrones1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41397071977-01-01Paper
La transitivite du groupe d'un code biprefixe fini1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41323921976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41034661976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41006801975-01-01Paper
Codes conjugués1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56829931971-01-01Paper
Congruences et automorphismes des automates finis1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56356231970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55816311969-01-01Paper
Density of group languages in shift spacesN/APaper

Research outcomes over time

This page was built for person: Dominique Perrin