Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Christian Choffrut
@article{DBLP:journals/corr/abs-2309-09566,
author = {Christian Choffrut},
title = {Synchronous orders on the set of integers},
journal = {CoRR},
volume = {abs/2309.09566},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.09566},
doi = {10.48550/ARXIV.2309.09566},
eprinttype = {arXiv},
eprint = {2309.09566},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-09566.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BesC22,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
title = {Decidability of Definability Issues in the Theory of Real Addition},
journal = {Fundam. Informaticae},
volume = {188},
number = {1},
pages = {15--39},
year = {2022},
url = {https://doi.org/10.3233/FI-222140},
doi = {10.3233/FI-222140},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/BesC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BesC21,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
title = {Theories of real addition with and without a predicate for integers},
journal = {Log. Methods Comput. Sci.},
volume = {17},
number = {2},
year = {2021},
url = {https://lmcs.episciences.org/7512},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BesC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BesC20,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
editor = {Alberto Leporati and
Carlos Mart{\'{\i}}n{-}Vide and
Dana Shapira and
Claudio Zandron},
title = {{\textdollar}{\textbackslash}langle {\textbackslash}mathbb \{R\},
+, {\textless}, 1 {\textbackslash}rangle {\textdollar} Is Decidable
in {\textdollar}{\textbackslash}langle {\textbackslash}mathbb \{R\},
+, {\textless} , {\textbackslash}mathbb \{Z\}{\textbackslash}rangle
{\textdollar}},
booktitle = {Language and Automata Theory and Applications - 14th International
Conference, {LATA} 2020, Milan, Italy, March 4-6, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12038},
pages = {128--140},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-40608-0\_8},
doi = {10.1007/978-3-030-40608-0\_8},
timestamp = {Thu, 27 Feb 2020 18:56:34 +0100},
biburl = {https://dblp.org/rec/conf/lata/BesC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04282,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
title = {Theories of real addition with and without a predicate for integers},
journal = {CoRR},
volume = {abs/2002.04282},
year = {2020},
url = {https://arxiv.org/abs/2002.04282},
eprinttype = {arXiv},
eprint = {2002.04282},
timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BesC19,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
title = {Complexity and (Un)decidability of Fragments of {\unicode{12296}}
{\(\omega\)} {\(\omega\)} {\(\lambda\)} ;{\texttimes} {\unicode{12297}}},
journal = {Fundam. Informaticae},
volume = {164},
number = {1},
pages = {1--15},
year = {2019},
url = {https://doi.org/10.3233/FI-2019-1752},
doi = {10.3233/FI-2019-1752},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/BesC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlanchetteCR19,
author = {Benjamin Blanchette and
Christian Choffrut and
Christophe Reutenauer},
title = {Quasi-automatic semigroups},
journal = {Theor. Comput. Sci.},
volume = {777},
pages = {111--120},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.01.002},
doi = {10.1016/J.TCS.2019.01.002},
timestamp = {Wed, 03 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BlanchetteCR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-02842,
author = {Benjamin Blanchette and
Christian Choffrut and
Christophe Reutenauer},
title = {Quasi-automatic semigroups},
journal = {CoRR},
volume = {abs/1906.02842},
year = {2019},
url = {http://arxiv.org/abs/1906.02842},
eprinttype = {arXiv},
eprint = {1906.02842},
timestamp = {Fri, 14 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-02842.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutE18,
author = {Christian Choffrut and
Zolt{\'{a}}n {\'{E}}sik},
title = {Two equational theories of partial words},
journal = {Theor. Comput. Sci.},
volume = {737},
pages = {19--39},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.04.010},
doi = {10.1016/J.TCS.2018.04.010},
timestamp = {Tue, 12 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-01418,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
title = {Complexity and (un)decidability of fragments of {\unicode{9001}} {\(\omega\)}\({}^{\mbox{{\(\omega\)}\({}^{\mbox{{\(\lambda\)}}}\)}}\);
{\texttimes} {\unicode{9002}}},
journal = {CoRR},
volume = {abs/1803.01418},
year = {2018},
url = {http://arxiv.org/abs/1803.01418},
eprinttype = {arXiv},
eprint = {1803.01418},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-01418.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-03028,
author = {Alexis B{\`{e}}s and
Christian Choffrut},
title = {Decidability of the existential fragment of some infinitely generated
trace monoids: an application to ordinals},
journal = {CoRR},
volume = {abs/1805.03028},
year = {2018},
url = {http://arxiv.org/abs/1805.03028},
eprinttype = {arXiv},
eprint = {1805.03028},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-03028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Choffrut17,
author = {Christian Choffrut},
title = {Sequences of words defined by two-way transducers},
journal = {Theor. Comput. Sci.},
volume = {658},
pages = {85--96},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.05.004},
doi = {10.1016/J.TCS.2016.05.004},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Choffrut17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Choffrut17a,
author = {Christian Choffrut},
title = {An Hadamard operation on rational relations},
journal = {Theor. Comput. Sci.},
volume = {664},
pages = {78--90},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2015.10.042},
doi = {10.1016/J.TCS.2015.10.042},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Choffrut17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/ChoffrutG16,
author = {Christian Choffrut and
Bruno Guillon},
editor = {Srecko Brlek and
Christophe Reutenauer},
title = {Both Ways Rational Functions},
booktitle = {Developments in Language Theory - 20th International Conference, {DLT}
2016, Montr{\'{e}}al, Canada, July 25-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9840},
pages = {114--124},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53132-7\_10},
doi = {10.1007/978-3-662-53132-7\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/ChoffrutG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/ChoffrutG15,
author = {Christian Choffrut and
Serge Grigorieff},
title = {Logical Theory of the Monoid of Languages over a Non Tally Alphabet},
journal = {Fundam. Informaticae},
volume = {138},
number = {1-2},
pages = {159--177},
year = {2015},
url = {https://doi.org/10.3233/FI-2015-1205},
doi = {10.3233/FI-2015-1205},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/ChoffrutG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/ChoffrutG15,
author = {Christian Choffrut and
Serge Grigorieff},
editor = {Lev D. Beklemishev and
Andreas Blass and
Nachum Dershowitz and
Bernd Finkbeiner and
Wolfram Schulte},
title = {Monadic Theory of a Linear Order Versus the Theory of its Subsets
with the Lifted Min/Max Operations},
booktitle = {Fields of Logic and Computation {II} - Essays Dedicated to Yuri Gurevich
on the Occasion of His 75th Birthday},
series = {Lecture Notes in Computer Science},
volume = {9300},
pages = {109--128},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23534-9\_6},
doi = {10.1007/978-3-319-23534-9\_6},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/ChoffrutG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Choffrut14,
author = {Christian Choffrut},
title = {Deciding Whether or Not a Synchronous Relation is Regular Prefix},
journal = {Fundam. Informaticae},
volume = {132},
number = {4},
pages = {439--459},
year = {2014},
url = {https://doi.org/10.3233/FI-2014-1053},
doi = {10.3233/FI-2014-1053},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Choffrut14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BertoniCD14,
author = {Alberto Bertoni and
Christian Choffrut and
Flavio D'Alessandro},
title = {On the Decidability of the Intersection Problem for Quantum Automata
and Context-Free Languages},
journal = {Int. J. Found. Comput. Sci.},
volume = {25},
number = {8},
pages = {1065--1082},
year = {2014},
url = {https://doi.org/10.1142/S0129054114400243},
doi = {10.1142/S0129054114400243},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BertoniCD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/ChoffrutG14,
author = {Christian Choffrut and
Bruno Guillon},
editor = {Stefano Bistarelli and
Andrea Formisano},
title = {An algebraic characterization of unary two-way transducers},
booktitle = {Proceedings of the 15th Italian Conference on Theoretical Computer
Science, Perugia, Italy, September 17-19, 2014},
series = {{CEUR} Workshop Proceedings},
volume = {1231},
pages = {279--283},
publisher = {CEUR-WS.org},
year = {2014},
url = {https://ceur-ws.org/Vol-1231/short7.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/ChoffrutG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChoffrutG14,
author = {Christian Choffrut and
Bruno Guillon},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {An Algebraic Characterization of Unary Two-Way Transducers},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8634},
pages = {196--207},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44522-8\_17},
doi = {10.1007/978-3-662-44522-8\_17},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChoffrutG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cwords/ChoffrutM13,
author = {Christian Choffrut and
Robert Mercas},
editor = {Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Luca Q. Zamboni},
title = {The Lexicographic Cross-Section of the Plactic Monoid Is Regular},
booktitle = {Combinatorics on Words - 9th International Conference, {WORDS} 2013,
Turku, Finland, September 16-20. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8079},
pages = {83--94},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40579-2\_11},
doi = {10.1007/978-3-642-40579-2\_11},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/cwords/ChoffrutM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BertoniCD13,
author = {Alberto Bertoni and
Christian Choffrut and
Flavio D'Alessandro},
editor = {Marie{-}Pierre B{\'{e}}al and
Olivier Carton},
title = {Quantum Finite Automata and Linear Context-Free Languages: {A} Decidable
Problem},
booktitle = {Developments in Language Theory - 17th International Conference, {DLT}
2013, Marne-la-Vall{\'{e}}e, France, June 18-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7907},
pages = {82--93},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38771-5\_9},
doi = {10.1007/978-3-642-38771-5\_9},
timestamp = {Sat, 19 Oct 2019 20:07:57 +0200},
biburl = {https://dblp.org/rec/conf/dlt/BertoniCD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-2967,
author = {Alberto Bertoni and
Christian Choffrut and
Flavio D'Alessandro},
title = {Quantum finite automata and linear context-free languages: a decidable
problem},
journal = {CoRR},
volume = {abs/1303.2967},
year = {2013},
url = {http://arxiv.org/abs/1303.2967},
eprinttype = {arXiv},
eprint = {1303.2967},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-2967.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ChoffrutMMP12,
author = {Christian Choffrut and
Andreas Malcher and
Carlo Mereghetti and
Beatrice Palano},
title = {First-order logics: some characterizations and closure properties},
journal = {Acta Informatica},
volume = {49},
number = {4},
pages = {225--248},
year = {2012},
url = {https://doi.org/10.1007/s00236-012-0157-z},
doi = {10.1007/S00236-012-0157-Z},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/ChoffrutMMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Choffrut12,
author = {Christian Choffrut},
title = {A Note on the Logical Definability of Rational Trace Languages},
journal = {Fundam. Informaticae},
volume = {116},
number = {1-4},
pages = {45--50},
year = {2012},
url = {https://doi.org/10.3233/FI-2012-667},
doi = {10.3233/FI-2012-667},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Choffrut12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutG12,
author = {Christian Choffrut and
Serge Grigorieff},
title = {Rational relations having a rational trace on each finite intersection
of rational relations},
journal = {Theor. Comput. Sci.},
volume = {454},
pages = {88--94},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.03.011},
doi = {10.1016/J.TCS.2012.03.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BertoniCR11,
author = {Alberto Bertoni and
Christian Choffrut and
Roberto Radicioni},
title = {The Inclusion Problem of Context-Free Languages: Some Tractable Cases},
journal = {Int. J. Found. Comput. Sci.},
volume = {22},
number = {2},
pages = {289--299},
year = {2011},
url = {https://doi.org/10.1142/S0129054111008040},
doi = {10.1142/S0129054111008040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BertoniCR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChoffrutK11,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
title = {Unique Decipherability in the Monoid of Languages: An Application
of Rational Relations},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {355--364},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9324-9},
doi = {10.1007/S00224-011-9324-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChoffrutK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/afl/Choffrut11,
author = {Christian Choffrut},
editor = {P{\'{a}}l D{\"{o}}m{\"{o}}si and
Szabolcs Iv{\'{a}}n},
title = {On relations of finite words over infinite alphabets},
booktitle = {Automata and Formal Languages, 13th International Conference, {AFL}
2011, Debrecen, Hungary, August 17-22, 2011, Proceedings},
pages = {25--27},
year = {2011},
timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
biburl = {https://dblp.org/rec/conf/afl/Choffrut11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/ChoffrutF10,
author = {Christian Choffrut and
Achille Frigeri},
title = {Deciding whether the ordering is necessary in a Presburger formula},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {12},
number = {1},
pages = {21--38},
year = {2010},
url = {https://doi.org/10.46298/dmtcs.510},
doi = {10.46298/DMTCS.510},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/ChoffrutF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/ChoffrutM10,
author = {Christian Choffrut and
Robert George Mercas},
title = {Contextual partial commutations},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {12},
number = {4},
pages = {59--72},
year = {2010},
url = {https://doi.org/10.46298/dmtcs.493},
doi = {10.46298/DMTCS.493},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/ChoffrutM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChoffrutDV10,
author = {Christian Choffrut and
Flavio D'Alessandro and
Stefano Varricchio},
title = {On Bounded Rational Trace Languages},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {351--369},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9143-9},
doi = {10.1007/S00224-008-9143-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChoffrutDV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/ChoffrutMMP10,
author = {Christian Choffrut and
Andreas Malcher and
Carlo Mereghetti and
Beatrice Palano},
editor = {Adrian{-}Horia Dediu and
Henning Fernau and
Carlos Mart{\'{\i}}n{-}Vide},
title = {On the Expressive Power of {FO[} + {]}},
booktitle = {Language and Automata Theory and Applications, 4th International Conference,
{LATA} 2010, Trier, Germany, May 24-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6031},
pages = {190--201},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13089-2\_16},
doi = {10.1007/978-3-642-13089-2\_16},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/ChoffrutMMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutG09,
author = {Christian Choffrut and
Serge Grigorieff},
title = {Finite n-tape automata over possibly infinite alphabets: Extending
a theorem of Eilenberg et al},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {16--34},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.07.018},
doi = {10.1016/J.TCS.2008.07.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutG09a,
author = {Christian Choffrut and
Serge Grigorieff},
title = {The "equal last letter" predicate for words on infinite
alphabets and classes of multitape automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2870--2884},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.034},
doi = {10.1016/J.TCS.2009.01.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutG09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/ChoffrutK09,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {Unique Decipherability in the Monoid of Languages: An Application
of Rational Relations},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {71--79},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_9},
doi = {10.1007/978-3-642-03351-3\_9},
timestamp = {Mon, 01 Mar 2021 13:46:21 +0100},
biburl = {https://dblp.org/rec/conf/csr/ChoffrutK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BertoniCR09,
author = {Alberto Bertoni and
Christian Choffrut and
Roberto Radicioni},
editor = {Volker Diekert and
Dirk Nowotka},
title = {The Inclusion Problem of Context-Free Languages: Some Tractable Cases},
booktitle = {Developments in Language Theory, 13th International Conference, {DLT}
2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5583},
pages = {103--112},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02737-6\_8},
doi = {10.1007/978-3-642-02737-6\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/BertoniCR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/ChoffrutC08,
author = {Christian Choffrut and
Lo{\"{\i}}c Colson},
title = {Preface},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {42},
number = {1},
pages = {1--4},
year = {2008},
url = {https://doi.org/10.1051/ita:2007056},
doi = {10.1051/ITA:2007056},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/ChoffrutC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Choffrut08,
author = {Christian Choffrut},
title = {Deciding whether a relation defined in Presburger logic can be defined
in weaker logics},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {42},
number = {1},
pages = {121--135},
year = {2008},
url = {https://doi.org/10.1051/ita:2007047},
doi = {10.1051/ITA:2007047},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Choffrut08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/BertoniCR08,
author = {Alberto Bertoni and
Christian Choffrut and
Roberto Radicioni},
editor = {Giorgio Ausiello and
Juhani Karhum{\"{a}}ki and
Giancarlo Mauri and
C.{-}H. Luke Ong},
title = {Literal Shuffle of Compressed Words},
booktitle = {Fifth {IFIP} International Conference On Theoretical Computer Science
- {TCS} 2008, {IFIP} 20th World Computer Congress, {TC} 1, Foundations
of Computer Science, September 7-10, 2008, Milano, Italy},
series = {{IFIP}},
volume = {273},
pages = {87--100},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-09680-3\_6},
doi = {10.1007/978-0-387-09680-3\_6},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/BertoniCR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutDV07,
author = {Christian Choffrut and
Flavio D'Alessandro and
Stefano Varricchio},
title = {On the separability of sparse context-free languages and of bounded
rational relations},
journal = {Theor. Comput. Sci.},
volume = {381},
number = {1-3},
pages = {274--279},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.04.003},
doi = {10.1016/J.TCS.2007.04.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutDV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/ChoffrutF07,
author = {Christian Choffrut and
Achille Frigeri},
editor = {Giuseppe F. Italiano and
Eugenio Moggi and
Luigi Laura},
title = {Definable sets in weak Presburger arithmetic},
booktitle = {Theoretical Computer Science, 10th Italian Conference, {ICTCS} 2007,
Rome, Italy, October 3-5, 2007, Proceedings},
pages = {175--186},
publisher = {World Scientific},
year = {2007},
timestamp = {Wed, 11 Jun 2008 08:55:26 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/ChoffrutF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Choffrut06,
author = {Christian Choffrut},
title = {Relations over Words and Logic: {A} Chronology},
journal = {Bull. {EATCS}},
volume = {89},
pages = {159--163},
year = {2006},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Choffrut06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoffrutG06,
author = {Christian Choffrut and
Serge Grigorieff},
title = {Separability of rational relations in A* {\texttimes} N\({}^{\mbox{\emph{m}}}\)
by recognizable relations is decidable},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {27--32},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.09.018},
doi = {10.1016/J.IPL.2005.09.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoffrutG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CampadelliCGT06,
author = {Paola Campadelli and
Christian Choffrut and
Massimiliano Goldwurm and
Mauro Torelli},
title = {Preface},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {40},
number = {2},
year = {2006},
url = {https://doi.org/10.1051/ita:2006018},
doi = {10.1051/ITA:2006018},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CampadelliCGT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CartonCG06,
author = {Olivier Carton and
Christian Choffrut and
Serge Grigorieff},
title = {Decision problems among the main subfamilies of rational relations},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {40},
number = {2},
pages = {255--275},
year = {2006},
url = {https://doi.org/10.1051/ita:2006005},
doi = {10.1051/ITA:2006005},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CartonCG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BertoniCGL06,
author = {Alberto Bertoni and
Christian Choffrut and
Massimiliano Goldwurm and
Violetta Lonati},
title = {Local Limit Properties for Pattern Statistics and Rational Models},
journal = {Theory Comput. Syst.},
volume = {39},
number = {1},
pages = {209--235},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1265-8},
doi = {10.1007/S00224-005-1265-8},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BertoniCGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BertoniCP06,
author = {Alberto Bertoni and
Christian Choffrut and
Beatrice Palano},
editor = {Oscar H. Ibarra and
Zhe Dang},
title = {Context-Free Grammars and {XML} Languages},
booktitle = {Developments in Language Theory, 10th International Conference, {DLT}
2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4036},
pages = {108--119},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11779148\_11},
doi = {10.1007/11779148\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/BertoniCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/ChoffrutK05,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
title = {Some decision problems on integer matrices},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {39},
number = {1},
pages = {125--131},
year = {2005},
url = {https://doi.org/10.1051/ita:2005007},
doi = {10.1051/ITA:2005007},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/ChoffrutK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/ChoffrutW05,
author = {Christian Choffrut and
Yoshiko Wakabayashi},
title = {Preface},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {39},
number = {1},
year = {2005},
url = {https://doi.org/10.1051/ita:2005020},
doi = {10.1051/ITA:2005020},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/ChoffrutW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutD05,
author = {Christian Choffrut and
Berke Durak},
title = {Collage of two-dimensional words},
journal = {Theor. Comput. Sci.},
volume = {340},
number = {1},
pages = {364--380},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.03.034},
doi = {10.1016/J.TCS.2005.03.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutD05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutH04,
author = {Christian Choffrut and
Yael Haddad},
title = {String-matching with OBDDs},
journal = {Theor. Comput. Sci.},
volume = {320},
number = {2-3},
pages = {187--198},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.11.023},
doi = {10.1016/J.TCS.2003.11.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Choffrut04,
author = {Christian Choffrut},
editor = {Juhani Karhum{\"{a}}ki and
Hermann A. Maurer and
Gheorghe Paun and
Grzegorz Rozenberg},
title = {Rational Relations as Rational Series},
booktitle = {Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion
of His 70th Birthday},
series = {Lecture Notes in Computer Science},
volume = {3113},
pages = {29--34},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27812-2\_3},
doi = {10.1007/978-3-540-27812-2\_3},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Choffrut04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/ChoffrutGL04,
author = {Christian Choffrut and
Massimiliano Goldwurm and
Violetta Lonati},
editor = {Cristian Calude and
Elena Calude and
Michael J. Dinneen},
title = {On the Maximum Coefficients of Rational Formal Series in Commuting
Variables},
booktitle = {Developments in Language Theory, 8th International Conference, {DLT}
2004, Auckland, New Zealand, December 13-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3340},
pages = {114--126},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30550-7\_10},
doi = {10.1007/978-3-540-30550-7\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/ChoffrutGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BertoniCGL04,
author = {Alberto Bertoni and
Christian Choffrut and
Massimiliano Goldwurm and
Violetta Lonati},
editor = {Volker Diekert and
Michel Habib},
title = {Local Limit Distributions in Pattern Statistics: Beyond the Markovian
Models},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {117--128},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_11},
doi = {10.1007/978-3-540-24749-4\_11},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BertoniCGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Choffrut03,
author = {Christian Choffrut},
title = {Minimizing subsequential transducers: a survey},
journal = {Theor. Comput. Sci.},
volume = {292},
number = {1},
pages = {131--143},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(01)00219-5},
doi = {10.1016/S0304-3975(01)00219-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Choffrut03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BertoniCGL03,
author = {Alberto Bertoni and
Christian Choffrut and
Massimiliano Goldwurm and
Violetta Lonati},
title = {On the number of occurrences of a symbol in words of regular languages},
journal = {Theor. Comput. Sci.},
volume = {302},
number = {1-3},
pages = {431--456},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00892-7},
doi = {10.1016/S0304-3975(02)00892-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BertoniCGL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutKO02,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki and
Nicolas Ollinger},
title = {The commutation of finite sets: a challenging problem},
journal = {Theor. Comput. Sci.},
volume = {273},
number = {1-2},
pages = {69--79},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(00)00434-5},
doi = {10.1016/S0304-3975(00)00434-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutKO02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutP02,
author = {Christian Choffrut and
Giovanni Pighizzini},
title = {Distances between languages and reflexivity of relations},
journal = {Theor. Comput. Sci.},
volume = {286},
number = {1},
pages = {117--138},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00238-9},
doi = {10.1016/S0304-3975(01)00238-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CartonC01,
author = {Olivier Carton and
Christian Choffrut},
title = {Periodicity and roots of transfinite strings},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {35},
number = {6},
pages = {525--533},
year = {2001},
url = {https://doi.org/10.1051/ita:2001102},
doi = {10.1051/ITA:2001102},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CartonC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BloomC01,
author = {Stephen L. Bloom and
Christian Choffrut},
title = {Long words: the theory of concatenation and omega-power},
journal = {Theor. Comput. Sci.},
volume = {259},
number = {1-2},
pages = {533--548},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00040-2},
doi = {10.1016/S0304-3975(00)00040-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BloomC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/ChoffrutK01,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Victor Mitrana},
title = {On Fatou properties of rational languages},
booktitle = {Where Mathematics, Computer Science, Linguistics and Biology Meet:
Essays in Honour of Gheorghe Paun},
pages = {227--235},
publisher = {Kluwer Academic Publishers},
year = {2001},
timestamp = {Fri, 09 Dec 2011 11:05:54 +0100},
biburl = {https://dblp.org/rec/conf/birthday/ChoffrutK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/Choffrut01,
author = {Christian Choffrut},
editor = {Werner Kuich and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Elementary Theory of Ordinals with Addition and Left Translation by
omega},
booktitle = {Developments in Language Theory, 5th International Conference, {DLT}
2001, Vienna, Austria, July 16-21, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2295},
pages = {15--20},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-46011-X\_2},
doi = {10.1007/3-540-46011-X\_2},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/Choffrut01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/ChoffrutH00,
author = {Christian Choffrut and
S{\'{a}}ndor Horv{\'{a}}th},
title = {Transfinite Equations in Transfinite Strings},
journal = {Int. J. Algebra Comput.},
volume = {10},
number = {5},
pages = {625--650},
year = {2000},
url = {https://doi.org/10.1142/S021819670000025X},
doi = {10.1142/S021819670000025X},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/ChoffrutH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/ChoffrutG00,
author = {Christian Choffrut and
Massimiliano Goldwurm},
title = {Timed Automata with Periodic Clock Constraints},
journal = {J. Autom. Lang. Comb.},
volume = {5},
number = {4},
pages = {371--403},
year = {2000},
url = {https://doi.org/10.25596/jalc-2000-371},
doi = {10.25596/JALC-2000-371},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/ChoffrutG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/ChoffrutG00,
author = {Christian Choffrut and
Serge Grigorieff},
editor = {Masami Ito and
Teruo Imaoka},
title = {The Theory of Rational Relations on Transfinite Strings},
booktitle = {Proceedings of the International Colloquium on Words, Languages {\&}
Combinatorics III, Kyoto, Japan, March 14-18, 2000},
pages = {103--133},
publisher = {World Scientific},
year = {2000},
timestamp = {Thu, 08 Dec 2011 13:57:12 +0100},
biburl = {https://dblp.org/rec/conf/dlt/ChoffrutG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChoffrutG99,
author = {Christian Choffrut and
Massimiliano Goldwurm},
title = {Determinants and M{\"{o}}bius functions in trace monoids},
journal = {Discret. Math.},
volume = {194},
number = {1-3},
pages = {239--247},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00211-8},
doi = {10.1016/S0012-365X(98)00211-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChoffrutG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/ChoffrutPS99,
author = {Christian Choffrut and
Hratchia P{\'{e}}libossian and
Pierre Simonnet},
title = {Decision Issues on Functions Realized by Finite Automata},
journal = {J. Autom. Lang. Comb.},
volume = {4},
number = {3},
pages = {171--181},
year = {1999},
url = {https://doi.org/10.25596/jalc-1999-171},
doi = {10.25596/JALC-1999-171},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/ChoffrutPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/ChoffrutG99,
author = {Christian Choffrut and
Serge Grigorieff},
editor = {Juhani Karhum{\"{a}}ki and
Hermann A. Maurer and
Gheorghe Paun and
Grzegorz Rozenberg},
title = {Uniformization of Rational Relations},
booktitle = {Jewels are Forever, Contributions on Theoretical Computer Science
in Honor of Arto Salomaa},
pages = {59--71},
publisher = {Springer},
year = {1999},
timestamp = {Mon, 29 Jul 2002 11:58:34 +0200},
biburl = {https://dblp.org/rec/conf/birthday/ChoffrutG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutD98,
author = {Christian Choffrut and
Flavio D'Alessandro},
title = {Commutativity in Free Inverse Monoids},
journal = {Theor. Comput. Sci.},
volume = {204},
number = {1-2},
pages = {35--54},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(98)00030-9},
doi = {10.1016/S0304-3975(98)00030-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChoffrutH98,
author = {Christian Choffrut and
S{\'{a}}ndor Horv{\'{a}}th},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Equations in Transfinite Strings},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {656--664},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055816},
doi = {10.1007/BFB0055816},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChoffrutH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutHK97,
author = {Christian Choffrut and
Tero Harju and
Juhani Karhum{\"{a}}ki},
title = {A Note on Decidability Questions on Presentations of Word Semigroups},
journal = {Theor. Comput. Sci.},
volume = {183},
number = {1},
pages = {83--92},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00311-8},
doi = {10.1016/S0304-3975(96)00311-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutHK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/PrieurCL97,
author = {Christophe Prieur and
Christian Choffrut and
Michel Latteux},
editor = {Jan Mycielski and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Constructing Sequential Bijections},
booktitle = {Structures in Logic and Computer Science, {A} Selection of Essays
in Honor of Andrzej Ehrenfeucht},
series = {Lecture Notes in Computer Science},
volume = {1261},
pages = {308--321},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63246-8\_19},
doi = {10.1007/3-540-63246-8\_19},
timestamp = {Sat, 30 May 2020 20:05:53 +0200},
biburl = {https://dblp.org/rec/conf/birthday/PrieurCL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ChoffrutG97,
author = {Christian Choffrut and
Leucio Guerra},
editor = {Bogdan S. Chlebus and
Ludwik Czaja},
title = {Generalized Rational Relations and their Logical Definability},
booktitle = {Fundamentals of Computation Theory, 11th International Symposium,
{FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1279},
pages = {138--149},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0036178},
doi = {10.1007/BFB0036178},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/ChoffrutG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChoffrurP97,
author = {Christian Choffrut and
Giovanni Pighizzini},
editor = {Igor Pr{\'{\i}}vara and
Peter Ruzicka},
title = {Distances Between Languages and Reflexivity of Relations},
booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International
Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1295},
pages = {199--208},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0029963},
doi = {10.1007/BFB0029963},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChoffrurP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/hfl/ChoffrutK97,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
editor = {Grzegorz Rozenberg and
Arto Salomaa},
title = {Combinatorics of Words},
booktitle = {Handbook of Formal Languages, Volume 1: Word, Language, Grammar},
pages = {329--438},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/978-3-642-59136-5\_6},
doi = {10.1007/978-3-642-59136-5\_6},
timestamp = {Sat, 30 May 2020 20:02:22 +0200},
biburl = {https://dblp.org/rec/reference/hfl/ChoffrutK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChoffrutG95,
author = {Christian Choffrut and
Leucio Guerra},
title = {Logical Definability of Some Rational Trace Languages},
journal = {Math. Syst. Theory},
volume = {28},
number = {5},
pages = {397--420},
year = {1995},
url = {https://doi.org/10.1007/BF01185864},
doi = {10.1007/BF01185864},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChoffrutG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChoffrutG95a,
author = {Christian Choffrut and
Massimiliano Goldwurm},
title = {Rational Transductions and Complexity of Counting Problems},
journal = {Math. Syst. Theory},
volume = {28},
number = {5},
pages = {437--450},
year = {1995},
url = {https://doi.org/10.1007/BF01185866},
doi = {10.1007/BF01185866},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChoffrutG95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ws/95/Choffrut95,
author = {Christian Choffrut},
editor = {Volker Diekert and
Grzegorz Rozenberg},
title = {Combinatorics in Trace Monoids {I}},
booktitle = {The Book of Traces},
pages = {71--82},
publisher = {World Scientific},
year = {1995},
url = {https://doi.org/10.1142/9789814261456\_0003},
doi = {10.1142/9789814261456\_0003},
timestamp = {Mon, 22 Jul 2019 19:53:40 +0200},
biburl = {https://dblp.org/rec/books/ws/95/Choffrut95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Baeza-YatesCG94,
author = {Ricardo A. Baeza{-}Yates and
Christian Choffrut and
Gaston H. Gonnet},
title = {On Boyer-Moore Automata},
journal = {Algorithmica},
volume = {12},
number = {4/5},
pages = {268--292},
year = {1994},
url = {https://doi.org/10.1007/BF01185428},
doi = {10.1007/BF01185428},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Baeza-YatesCG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Choffrut94,
author = {Christian Choffrut},
title = {Bijective Sequential Mappings of a Free Monoid Onto Another},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {28},
number = {3-4},
pages = {265--276},
year = {1994},
url = {https://doi.org/10.1051/ita/1994283-402651},
doi = {10.1051/ITA/1994283-402651},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Choffrut94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Choffrut93,
author = {Christian Choffrut},
title = {On the Starheight of Some Rational Subsets Closed under Partial Commutations},
journal = {Inf. Comput.},
volume = {106},
number = {1},
pages = {61--82},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1049},
doi = {10.1006/INCO.1993.1049},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Choffrut93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/Choffrut93,
author = {Christian Choffrut},
title = {Conjugacy in Free Inverse Monoids},
journal = {Int. J. Algebra Comput.},
volume = {3},
number = {2},
pages = {169--188},
year = {1993},
url = {https://doi.org/10.1142/S0218196793000135},
doi = {10.1142/S0218196793000135},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/Choffrut93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChoffrutG93,
author = {Christian Choffrut and
Leucio Guerra},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {On the Logical Definability of Some Rational Trace Languages},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {494--504},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_49},
doi = {10.1007/3-540-56503-5\_49},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChoffrutG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Choffrut92,
author = {Christian Choffrut},
title = {Rational Relations and Ratonal Series},
journal = {Theor. Comput. Sci.},
volume = {98},
number = {1},
pages = {5--13},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90375-P},
doi = {10.1016/0304-3975(92)90375-P},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Choffrut92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChoffrutG92,
author = {Christian Choffrut and
Massimiliano Goldwurm},
editor = {Ivan M. Havel and
V{\'{a}}clav Koubek},
title = {Rational Transductions and Complexity of Counting Problems},
booktitle = {Mathematical Foundations of Computer Science 1992, 17th International
Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {629},
pages = {181--190},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55808-X\_16},
doi = {10.1007/3-540-55808-X\_16},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChoffrutG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Choffrut91,
author = {Christian Choffrut},
title = {Conjugacies},
journal = {Bull. {EATCS}},
volume = {45},
pages = {148--157},
year = {1991},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Choffrut91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwwert/Choffrut91,
author = {Christian Choffrut},
editor = {Habib Abdulrab and
Jean{-}Pierre P{\'{e}}cuchet},
title = {Conjugacy in Free Inverse Monoids},
booktitle = {Word Equations and Related Topics, Second International Workshop,
{IWWERT} '91, Rouen, France, October 7-9, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {677},
pages = {6--22},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-56730-5\_28},
doi = {10.1007/3-540-56730-5\_28},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/iwwert/Choffrut91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1991,
editor = {Christian Choffrut and
Matthias Jantzen},
title = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {480},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0020782},
doi = {10.1007/BFB0020782},
isbn = {3-540-53709-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/1991.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Choffrut90,
author = {Christian Choffrut},
title = {An Optimal Algorithm for building the Boyer-Moore automaton},
journal = {Bull. {EATCS}},
volume = {40},
pages = {217--224},
year = {1990},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Choffrut90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Choffrut90,
author = {Christian Choffrut},
editor = {Mike Paterson},
title = {Iterated Substitutions and Locally Catanative Systems: {A} Decidability
Result in the Binary Case},
booktitle = {Automata, Languages and Programming, 17th International Colloquium,
ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {443},
pages = {490--500},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0032053},
doi = {10.1007/BFB0032053},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Choffrut90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1990,
editor = {Christian Choffrut and
Thomas Lengauer},
title = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer
Science, Rouen, France, February 22-24, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {415},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52282-4},
doi = {10.1007/3-540-52282-4},
isbn = {3-540-52282-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/1990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutS88,
author = {Christian Choffrut and
Marcel Paul Sch{\"{u}}tzenberger},
title = {Counting with Rational Functions},
journal = {Theor. Comput. Sci.},
volume = {58},
pages = {81--101},
year = {1988},
url = {https://doi.org/10.1016/0304-3975(88)90020-5},
doi = {10.1016/0304-3975(88)90020-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/litp/1986,
editor = {Christian Choffrut},
title = {Automata Networks, {LITP} Spring School on Theoretical Computer Science,
Angel{\`{e}}s-Village, France, May 12-16, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {316},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19444-4},
doi = {10.1007/3-540-19444-4},
isbn = {3-540-19444-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/litp/1986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChoffrutD87,
author = {Christian Choffrut and
Christine Duboc},
editor = {Thomas Ottmann},
title = {A Star-Height Problem in Free Monoids with Partial Communications},
booktitle = {Automata, Languages and Programming, 14th International Colloquium,
ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {267},
pages = {190--201},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18088-5\_15},
doi = {10.1007/3-540-18088-5\_15},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChoffrutD87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChoffrutS86,
author = {Christian Choffrut and
Marcel Paul Sch{\"{u}}tzenberger},
editor = {Laurent Kott},
title = {Counting with Rational Functions},
booktitle = {Automata, Languages and Programming, 13th International Colloquium,
ICALP86, Rennes, France, July 15-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {226},
pages = {79--88},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16761-7\_57},
doi = {10.1007/3-540-16761-7\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChoffrutS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/litp/Choffrut86,
author = {Christian Choffrut},
editor = {Christian Choffrut},
title = {An Introduction to Automata Network Theory},
booktitle = {Automata Networks, {LITP} Spring School on Theoretical Computer Science,
Angel{\`{e}}s-Village, France, May 12-16, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {316},
pages = {1--18},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-19444-4\_10},
doi = {10.1007/3-540-19444-4\_10},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/litp/Choffrut86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChoffrutS86,
author = {Christian Choffrut and
Marcel Paul Sch{\"{u}}tzenberger},
editor = {Burkhard Monien and
Guy Vidal{-}Naquet},
title = {D{\'{e}}composition de Fonctions Rationnelles},
booktitle = {{STACS} 86, 3rd Annual Symposium on Theoretical Aspects of Computer
Science, Orsay, France, January 16-18, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {210},
pages = {213--226},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16078-7\_78},
doi = {10.1007/3-540-16078-7\_78},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChoffrutS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChoffrutK85,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
title = {Test sets for morphisms with bounded delay},
journal = {Discret. Appl. Math.},
volume = {12},
number = {2},
pages = {93--101},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90063-0},
doi = {10.1016/0166-218X(85)90063-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChoffrutK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ChoffrutC84,
author = {Christian Choffrut and
Karel Cul{\'{\i}}k II},
title = {On Real-Time Cellular Automata and Trellis Automata},
journal = {Acta Informatica},
volume = {21},
pages = {393--407},
year = {1984},
url = {https://doi.org/10.1007/BF00264617},
doi = {10.1007/BF00264617},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/acta/ChoffrutC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChoffrutC84,
author = {Christian Choffrut and
Karel Cul{\'{\i}}k II},
title = {On extendibility of unavoidable sets},
journal = {Discret. Appl. Math.},
volume = {9},
number = {2},
pages = {125--137},
year = {1984},
url = {https://doi.org/10.1016/0166-218X(84)90014-3},
doi = {10.1016/0166-218X(84)90014-3},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChoffrutC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChoffrutC84,
author = {Christian Choffrut and
Karel Cul{\'{\i}}k II},
editor = {Max Fontet and
Kurt Mehlhorn},
title = {On Extendibility of Unavoidable Sets},
booktitle = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science,
Paris, France, 11-13 April, 1984, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {166},
pages = {326--338},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-12920-0\_30},
doi = {10.1007/3-540-12920-0\_30},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ChoffrutC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoffrutC83,
author = {Christian Choffrut and
Karel Cul{\'{\i}}k II},
title = {Folding of the Plane and the Design of Systolic Arrays},
journal = {Inf. Process. Lett.},
volume = {17},
number = {3},
pages = {149--153},
year = {1983},
url = {https://doi.org/10.1016/0020-0190(83)90055-8},
doi = {10.1016/0020-0190(83)90055-8},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChoffrutC83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChoffrutC83,
author = {Christian Choffrut and
Karel Cul{\'{\i}}k II},
title = {Properties of Finite and Pushdown Transducers},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {300--315},
year = {1983},
url = {https://doi.org/10.1137/0212019},
doi = {10.1137/0212019},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChoffrutC83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChoffrutK83,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
editor = {Josep D{\'{\i}}az},
title = {Test Sets for Morphisms with Bounded Delay},
booktitle = {Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain,
July 18-22, 1983, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {154},
pages = {118--127},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/BFb0036902},
doi = {10.1007/BFB0036902},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChoffrutK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Choffrut81,
author = {Christian Choffrut},
title = {A Closure Property of Deterministic Context-Free Languages},
journal = {Inf. Process. Lett.},
volume = {12},
number = {1},
pages = {13--16},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90067-3},
doi = {10.1016/0020-0190(81)90067-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Choffrut81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/Choffrut81,
author = {Christian Choffrut},
editor = {Peter Deussen},
title = {Prefix-Preservation fo Rational Partial Functions Is Decidable},
booktitle = {Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany,
March 23-25, 1981, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {104},
pages = {159--166},
publisher = {Springer},
year = {1981},
url = {https://doi.org/10.1007/BFb0017308},
doi = {10.1007/BFB0017308},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/tcs/Choffrut81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Choffrut79,
author = {Christian Choffrut},
editor = {Hermann A. Maurer},
title = {A Generalization of Ginsburg and Rose's Characterization of {G-S-M}
Mappings},
booktitle = {Automata, Languages and Programming, 6th Colloquium, Graz, Austria,
July 16-20, 1979, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {71},
pages = {88--103},
publisher = {Springer},
year = {1979},
url = {https://doi.org/10.1007/3-540-09510-1\_8},
doi = {10.1007/3-540-09510-1\_8},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Choffrut79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Choffrut78,
author = {Christian Choffrut},
title = {Sur les traductions reconnaissables},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {12},
number = {3},
pages = {203--212},
year = {1978},
url = {https://doi.org/10.1051/ita/1978120302031},
doi = {10.1051/ITA/1978120302031},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Choffrut78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/Choffrut77,
author = {Christian Choffrut},
title = {Applications s{\'{e}}quentielles permutables},
journal = {J. Inf. Process. Cybern.},
volume = {13},
number = {7/8},
pages = {351--357},
year = {1977},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/Choffrut77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Christian77,
author = {Christian Choffrut},
title = {Sur Certaines Applications S{\'{e}}quentielles Num{\'{e}}riques},
journal = {Inf. Control.},
volume = {33},
number = {4},
pages = {352--363},
year = {1977},
url = {https://doi.org/10.1016/S0019-9958(77)90470-3},
doi = {10.1016/S0019-9958(77)90470-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Christian77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Choffrut77,
author = {Christian Choffrut},
title = {Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles
en tant que Relations Rationnelles},
journal = {Theor. Comput. Sci.},
volume = {5},
number = {3},
pages = {325--337},
year = {1977},
url = {https://doi.org/10.1016/0304-3975(77)90049-4},
doi = {10.1016/0304-3975(77)90049-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Choffrut77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Choffrut76,
author = {Christian Choffrut},
editor = {Antoni W. Mazurkiewicz},
title = {Strongly Connected {G-S-M} Mappings Preserving Conjugation},
booktitle = {Mathematical Foundations of Computer Science 1976, 5th Symposium,
Gdansk, Poland, September 6-10, 1976, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {45},
pages = {224--229},
publisher = {Springer},
year = {1976},
url = {https://doi.org/10.1007/3-540-07854-1\_178},
doi = {10.1007/3-540-07854-1\_178},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Choffrut76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Choffrut72,
author = {Christian Choffrut},
editor = {Maurice Nivat},
title = {Transducteurs conservant l'imprimitivit{\'{e}} du langage d'entr{\'{e}}e},
booktitle = {Automata, Languages and Programming, Colloquium, Paris, France, July
3-7, 1972},
pages = {13--29},
publisher = {North-Holland, Amsterdam},
year = {1972},
timestamp = {Mon, 08 Jul 2019 10:59:18 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Choffrut72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:57 CEST 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:
