The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Choffrut: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Choffrut
    Rational Relations as Rational Series. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:29-34 [Conf]
  2. Christian Choffrut, Serge Grigorieff
    Uniformization of Rational Relations. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:59-71 [Conf]
  3. Christophe Prieur, Christian Choffrut, Michel Latteux
    Constructing Sequential Bijections. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:308-321 [Conf]
  4. Christian Choffrut
    Elementary Theory of Ordinals with Addition and Left Translation by omega. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:15-20 [Conf]
  5. Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
    On the Maximum Coefficients of Rational Formal Series in Commuting Variables. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:114-126 [Conf]
  6. Alberto Bertoni, Christian Choffrut, Beatrice Palano
    Context-Free Grammars and XML Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:108-119 [Conf]
  7. Christian Choffrut, Leucio Guerra
    Generalized Rational Relations and their Logical Definability. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:138-149 [Conf]
  8. Christian Choffrut
    Transducteurs conservant l'imprimitivité du langage d'entrée. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:13-29 [Conf]
  9. Christian Choffrut
    A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:88-103 [Conf]
  10. Christian Choffrut
    Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:490-500 [Conf]
  11. Christian Choffrut, Christine Duboc
    A Star-Height Problem in Free Monoids with Partial Communications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:190-201 [Conf]
  12. Christian Choffrut, Juhani Karhumäki
    Test Sets for Morphisms with Bounded Delay. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:118-127 [Conf]
  13. Christian Choffrut, Marcel Paul Schützenberger
    Counting with Rational Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:79-88 [Conf]
  14. Christian Choffrut
    Conjugacy in Free Inverse Monoids. [Citation Graph (0, 0)][DBLP]
    IWWERT, 1991, pp:6-22 [Conf]
  15. Christian Choffrut
    An Introduction to Automata Network Theory. [Citation Graph (0, 0)][DBLP]
    Automata Networks, 1986, pp:1-18 [Conf]
  16. Christian Choffrut, Giovanni Pighizzini
    Distances Between Languages and Reflexivity of Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:199-208 [Conf]
  17. Christian Choffrut
    Strongly Connected G-S-M Mappings Preserving Conjugation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:224-229 [Conf]
  18. Christian Choffrut, Massimiliano Goldwurm
    Rational Transductions and Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:181-190 [Conf]
  19. Christian Choffrut, Sándor Horváth
    Equations in Transfinite Strings. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:656-664 [Conf]
  20. Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
    Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:117-128 [Conf]
  21. Christian Choffrut, Karel Culik II
    On Extendibility of Unavoidable Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:326-338 [Conf]
  22. Christian Choffrut, Leucio Guerra
    On the Logical Definability of Some Rational Trace Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:494-504 [Conf]
  23. Christian Choffrut, Marcel Paul Schützenberger
    Décomposition de Fonctions Rationnelles. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:213-226 [Conf]
  24. Christian Choffrut
    Prefix-Preservation fo Rational Partial Functions Is Decidable. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:159-166 [Conf]
  25. Christian Choffrut, Karel Culik II
    On Real-Time Cellular Automata and Trellis Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:393-407 [Journal]
  26. Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet
    On Boyer-Moore Automata. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:268-292 [Journal]
  27. Christian Choffrut
    An Optimal Algorithm for building the Boyer-Moore automaton. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:217-224 [Journal]
  28. Christian Choffrut
    Conjugacies. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:45, n:, pp:148-157 [Journal]
  29. Christian Choffrut
    Applications séquentielles permutables. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1977, v:13, n:7/8, pp:351-357 [Journal]
  30. Christian Choffrut
    On the Starheight of Some Rational Subsets Closed under Partial Commutations [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:106, n:1, pp:61-82 [Journal]
  31. Christian Choffrut
    Sur Certaines Applications Séquentielles Numériques [Citation Graph (0, 0)][DBLP]
    Information and Control, 1977, v:33, n:4, pp:352-363 [Journal]
  32. Christian Choffrut, Sándor Horváth
    Transfinite Equations in Transfinite Strings. [Citation Graph (0, 0)][DBLP]
    IJAC, 2000, v:10, n:5, pp:625-650 [Journal]
  33. Christian Choffrut
    A Closure Property of Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:13-16 [Journal]
  34. Christian Choffrut, Karel Culik II
    Folding of the Plane and the Design of Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:3, pp:149-153 [Journal]
  35. Christian Choffrut, Serge Grigorieff
    Separability of rational relations in A* × Nm by recognizable relations is decidable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:1, pp:27-32 [Journal]
  36. Olivier Carton, Christian Choffrut
    Periodicity and roots of transfinite strings. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:525-533 [Journal]
  37. Christian Choffrut
    Sur les traductions reconnaissables. [Citation Graph (0, 0)][DBLP]
    ITA, 1978, v:12, n:3, pp:- [Journal]
  38. Christian Choffrut
    Bijective Sequential Mappings of a Free Monoid Onto Another. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:265-276 [Journal]
  39. Christian Choffrut, Massimiliano Goldwurm
    Timed Automata with Periodic Clock Constraints. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:4, pp:371-404 [Journal]
  40. Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet
    Decision Issues on Functions Realized by Finite Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:171-182 [Journal]
  41. Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
    Local Limit Properties for Pattern Statistics and Rational Models. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:209-235 [Journal]
  42. Christian Choffrut, Leucio Guerra
    Logical Definability of Some Rational Trace Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:5, pp:397-420 [Journal]
  43. Christian Choffrut, Massimiliano Goldwurm
    Rational Transductions and Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:5, pp:437-450 [Journal]
  44. Christian Choffrut, Karel Culik II
    Properties of Finite and Pushdown Transducers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:300-315 [Journal]
  45. Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
    On the number of occurrences of a symbol in words of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:431-456 [Journal]
  46. Stephen L. Bloom, Christian Choffrut
    Long words: the theory of concatenation and omega-power. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:533-548 [Journal]
  47. Christian Choffrut
    Minimizing subsequential transducers: a survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:131-143 [Journal]
  48. Christian Choffrut
    Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:5, n:3, pp:325-337 [Journal]
  49. Christian Choffrut
    Rational Relations and Ratonal Series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:98, n:1, pp:5-13 [Journal]
  50. Christian Choffrut, Berke Durak
    Collage of two-dimensional words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:1, pp:364-380 [Journal]
  51. Christian Choffrut, Flavio D'Alessandro
    Commutativity in Free Inverse Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:204, n:1-2, pp:35-54 [Journal]
  52. Christian Choffrut, Y. Haddad
    String-matching with OBDDs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:187-198 [Journal]
  53. Christian Choffrut, Tero Harju, Juhani Karhumäki
    A Note on Decidability Questions on Presentations of Word Semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:183, n:1, pp:83-92 [Journal]
  54. Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
    The commutation of finite sets: a challenging problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:69-79 [Journal]
  55. Christian Choffrut, Giovanni Pighizzini
    Distances between languages and reflexivity of relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:286, n:1, pp:117-138 [Journal]
  56. Christian Choffrut, Marcel Paul Schützenberger
    Counting with Rational Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:81-101 [Journal]
  57. Christian Choffrut, Massimiliano Goldwurm
    Determinants and Möbius functions in trace monoids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:239-247 [Journal]
  58. Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
    On the separability of sparse context-free languages and of bounded rational relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:274-279 [Journal]

  59. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. [Citation Graph (, )][DBLP]


  60. The Inclusion Problem of Context-Free Languages: Some Tractable Cases. [Citation Graph (, )][DBLP]


  61. Definable sets in weak Presburger arithmetic. [Citation Graph (, )][DBLP]


  62. Literal Shuffle of Compressed Words. [Citation Graph (, )][DBLP]


  63. On the Expressive Power of FO[ + ]. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002