| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alberto Bertoni, Christian Choffrut, Roberto Radicioni |
The Inclusion Problem of Context-Free Languages: Some Tractable Cases.  |
Int. J. Found. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Juhani Karhumäki |
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
On relations of finite words over infinite alphabets. |
AFL |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Robert George Mercas |
Contextual partial commutations. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Achille Frigeri |
Deciding whether the ordering is necessary in a Presburger formula. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio |
On Bounded Rational Trace Languages. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
On the Expressive Power of FO[ + ]. |
LATA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Juhani Karhumäki |
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
Unique decipherability, finite automata, regular languages |
| 1 | Alberto Bertoni, Christian Choffrut, Roberto Radicioni |
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. |
Developments in Language Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Deciding whether a relation defined in Presburger logic can be defined in weaker logics. |
ITA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Loïc Colson |
Preface. |
ITA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Bertoni, Christian Choffrut, Roberto Radicioni |
Literal Shuffle of Compressed Words. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio |
On the separability of sparse context-free languages and of bounded rational relations. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Achille Frigeri |
Definable sets in weak Presburger arithmetic. |
ICTCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
Separability of rational relations in A* × Nm by recognizable relations is decidable. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Carton, Christian Choffrut, Serge Grigorieff |
Decision problems among the main subfamilies of rational relations. |
ITA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Campadelli, Christian Choffrut, Massimiliano Goldwurm, Mauro Torelli |
Preface. |
ITA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Relations over Words and Logic: A Chronology. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
Local Limit Properties for Pattern Statistics and Rational Models. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Bertoni, Christian Choffrut, Beatrice Palano |
Context-Free Grammars and XML Languages. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Berke Durak |
Collage of two-dimensional words. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Juhani Karhumäki |
Some decision problems on integer matrices. |
ITA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Yoshiko Wakabayashi |
Preface. |
ITA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Y. Haddad |
String-matching with OBDDs. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
On the Maximum Coefficients of Rational Formal Series in Commuting Variables. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Rational Relations as Rational Series. |
Theory Is Forever |
2004 |
DBLP DOI BibTeX RDF |
free monoid, rational relation, rational series |
| 1 | Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
On the number of occurrences of a symbol in words of regular languages. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Minimizing subsequential transducers: a survey. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Giovanni Pighizzini |
Distances between languages and reflexivity of relations. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger |
The commutation of finite sets: a challenging problem. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen L. Bloom, Christian Choffrut |
Long words: the theory of concatenation and omega-power. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Carton, Christian Choffrut |
Periodicity and roots of transfinite strings. |
ITA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Elementary Theory of Ordinals with Addition and Left Translation by omega. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Juhani Karhumäki |
On Fatou properties of rational languages. |
Where Mathematics, Computer Science, Linguistics and Biology Meet |
2001 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Sándor Horváth |
Transfinite Equations in Transfinite Strings. |
IJAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Massimiliano Goldwurm |
Timed Automata with Periodic Clock Constraints. |
Journal of Automata, Languages and Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
The Theory of Rational Relations on Transfinite Strings. |
Words, Languages & Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Massimiliano Goldwurm |
Determinants and Möbius functions in trace monoids. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet |
Decision Issues on Functions Realized by Finite Automata. |
Journal of Automata, Languages and Combinatorics |
1999 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Serge Grigorieff |
Uniformization of Rational Relations. |
Jewels are Forever |
1999 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Flavio D'Alessandro |
Commutativity in Free Inverse Monoids. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Sándor Horváth |
Equations in Transfinite Strings. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Tero Harju, Juhani Karhumäki |
A Note on Decidability Questions on Presentations of Word Semigroups. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Giovanni Pighizzini |
Distances Between Languages and Reflexivity of Relations. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Leucio Guerra |
Generalized Rational Relations and their Logical Definability. |
FCT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Prieur, Christian Choffrut, Michel Latteux |
Constructing Sequential Bijections. |
Structures in Logic and Computer Science |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Leucio Guerra |
Logical Definability of Some Rational Trace Languages. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Massimiliano Goldwurm |
Rational Transductions and Complexity of Counting Problems. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Bijective Sequential Mappings of a Free Monoid Onto Another. |
ITA |
1994 |
DBLP BibTeX RDF |
|
| 1 | Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet |
On Boyer-Moore Automata. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
On the Starheight of Some Rational Subsets Closed under Partial Commutations |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Leucio Guerra |
On the Logical Definability of Some Rational Trace Languages. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Rational Relations and Ratonal Series. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Massimiliano Goldwurm |
Rational Transductions and Complexity of Counting Problems. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Conjugacies. |
Bulletin of the EATCS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Matthias Jantzen (eds.) |
STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings |
STACS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut |
Conjugacy in Free Inverse Monoids. |
IWWERT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
An Optimal Algorithm for building the Boyer-Moore automaton. |
Bulletin of the EATCS |
1990 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut |
Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
substitutions in the free monoids, DOL-systems, DOL-sequences, linear recurrence equations, locally catenative systems, finite deciphering delay of codes, equations in words |
| 1 | Christian Choffrut, Thomas Lengauer (eds.) |
STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings |
STACS |
1990 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Marcel Paul Schützenberger |
Counting with Rational Functions. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut (eds.) |
Automata Networks, LITP Spring School on Theoretical Computer Science, Angelès-Village, France, May 12-16, 1986, Proceedings |
Automata Networks |
1988 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut, Christine Duboc |
A Star-Height Problem in Free Monoids with Partial Communications. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Marcel Paul Schützenberger |
Counting with Rational Functions. |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Marcel Paul Schützenberger |
Décomposition de Fonctions Rationnelles. |
STACS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
An Introduction to Automata Network Theory. |
Automata Networks |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Karel Culik II |
On Real-Time Cellular Automata and Trellis Automata. |
Acta Inf. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Karel Culik II |
On Extendibility of Unavoidable Sets. |
STACS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Karel Culik II |
Folding of the Plane and the Design of Systolic Arrays. |
Inf. Process. Lett. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Karel Culik II |
Properties of Finite and Pushdown Transducers. |
SIAM J. Comput. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut, Juhani Karhumäki |
Test Sets for Morphisms with Bounded Delay. |
ICALP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
A Closure Property of Deterministic Context-Free Languages. |
Inf. Process. Lett. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Prefix-Preservation fo Rational Partial Functions Is Decidable. |
Theoretical Computer Science |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Sur les traductions reconnaissables. |
ITA |
1978 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut |
Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. |
Theor. Comput. Sci. |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Sur Certaines Applications Séquentielles Numériques |
Information and Control |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Applications séquentielles permutables. |
Elektronische Informationsverarbeitung und Kybernetik |
1977 |
DBLP BibTeX RDF |
|
| 1 | Christian Choffrut |
Strongly Connected G-S-M Mappings Preserving Conjugation. |
MFCS |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Choffrut |
Transducteurs conservant l'imprimitivité du langage d'entrée. |
ICALP |
1972 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")