Travelled to:
1 × Hungary
1 × Japan
1 × New Zealand
1 × Spain
1 × The Netherlands
1 × USA
2 × Austria
2 × France
3 × Germany
Collaborated with:
∅ A.Bertoni F.D'Alessandro R.Radicioni B.Palano S.Grigorieff C.Duboc M.P.Schützenberger J.Karhumäki M.Goldwurm V.Lonati A.Malcher C.Mereghetti
Talks about:
free (6) problem (5) languag (5) context (5) ration (3) decid (3) case (3) tractabl (2) automata (2) quantum (2)
Person: Christian Choffrut
DBLP: Choffrut:Christian
Contributed to:
Wrote 16 papers:
- DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum
- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
- DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum
- On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
- AFL-2011-Choffrut #finite #infinity #on the #word
- On relations of finite words over infinite alphabets (CC), pp. 25–27.
- LATA-2010-ChoffrutMMP #on the #power of
- On the Expressive Power of FO[+] (CC, AM, CM, BP), pp. 190–201.
- DLT-2009-BertoniCR #context-free grammar #problem
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 103–112.
- DLT-J-2009-BertoniCR11 #context-free grammar #problem
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 289–299.
- DLT-2006-BertoniCP #context-free grammar #xml
- Context-Free Grammars and XML Languages (AB, CC, BP), pp. 108–119.
- DLT-2004-ChoffrutGL #on the
- On the Maximum Coefficients of Rational Formal Series in Commuting Variables (CC, MG, VL), pp. 114–126.
- DLT-2001-Choffrut
- Elementary Theory of Ordinals with Addition and Left Translation by ω (CC), pp. 15–20.
- WLC-2000-ChoffrutG #formal method #string
- The Theory of Rational Relations on Transfinite Strings (CC, SG), pp. 103–133.
- ICALP-1990-Choffrut #decidability
- Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case (CC), pp. 490–500.
- ICALP-1987-ChoffrutD #monad #problem
- A Star-Height Problem in Free Monoids with Partial Communications (CC, CD), pp. 190–201.
- ICALP-1986-ChoffrutS
- Counting with Rational Functions (CC, MPS), pp. 79–88.
- ICALP-1983-ChoffrutK #bound #morphism #testing
- Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.
- ICALP-1979-Choffrut
- A Generalization of Ginsburg and Rose’s Characterization of G-S-M Mappings (CC), pp. 88–103.
- ICALP-1972-Choffrut #french
- Transducteurs conservant l’imprimitivité du langage d’entrée (CC), pp. 13–29.