Christian Choffrut

From MaRDI portal
(Redirected from Christian Choffrut)
Person:512187

Available identifiers

zbMath Open choffrut.christianMaRDI QIDQ512187

List of research outcomes

PublicationDate of PublicationType
Decidability of Definability Issues in the Theory of Real Addition2023-03-09Paper
Generalized rational relations and their logical definability2022-12-09Paper
Grammic monoids with three generators2022-11-23Paper
Rational transductions and complexity of counting problems2022-08-18Paper
Grammic monoids with three generators2022-07-26Paper
https://portal.mardi4nfdi.de/entity/Q50097042021-08-05Paper
Decidability of definability issues in the theory of real addition2021-02-11Paper
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\)2020-08-12Paper
\(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\)2020-07-27Paper
Theories of real addition with and without a predicate for integers2020-02-11Paper
Quasi-automatic semigroups2019-06-18Paper
Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉2019-06-14Paper
Two equational theories of partial words2018-06-18Paper
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals2018-05-08Paper
An Hadamard operation on rational relations2017-03-16Paper
A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid2017-02-24Paper
Sequences of words defined by two-way transducers2016-12-19Paper
Both Ways Rational Functions2016-08-30Paper
https://portal.mardi4nfdi.de/entity/Q57404082016-07-26Paper
Logical Theory of the Monoid of Languages over a Non Tally Alphabet2016-05-11Paper
Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations2015-09-22Paper
ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES2015-04-23Paper
Logical Theory of the Additive Monoid of Subsets of Natural Integers2015-04-14Paper
Deciding Whether or Not a Synchronous Relation is Regular Prefix2014-12-22Paper
An Algebraic Characterization of Unary Two-Way Transducers2014-10-14Paper
https://portal.mardi4nfdi.de/entity/Q54145482014-05-06Paper
The Lexicographic Cross-Section of the Plactic Monoid Is Regular2013-09-20Paper
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem2013-06-28Paper
First-order logics: some characterizations and closure properties2012-10-15Paper
Rational relations having a rational trace on each finite intersection of rational relations2012-10-11Paper
https://portal.mardi4nfdi.de/entity/Q28932982012-06-20Paper
Unique decipherability in the monoid of languages: an application of rational relations2011-10-11Paper
THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES2011-03-30Paper
https://portal.mardi4nfdi.de/entity/Q35754672010-07-27Paper
On the Expressive Power of FO[ + ]2010-05-26Paper
On bounded rational trace languages2010-05-10Paper
Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable2010-01-29Paper
The decision problem for some logics for finite words on infinite alphabets2010-01-15Paper
https://portal.mardi4nfdi.de/entity/Q33965892009-09-19Paper
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations2009-08-18Paper
The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata2009-08-07Paper
The Inclusion Problem of Context-Free Languages: Some Tractable Cases2009-07-07Paper
Context-Free Grammars and XML Languages2009-03-26Paper
Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.2009-02-19Paper
Preface2008-07-21Paper
Deciding whether a relation defined in Presburger logic can be defined in weaker logics2008-07-21Paper
STACS 20042007-10-01Paper
On the separability of sparse context-free languages and of bounded rational relations2007-09-03Paper
Preface2007-04-10Paper
Decision problems among the main subfamilies of rational relations2007-04-10Paper
Local limit properties for pattern statistics and rational models2006-10-25Paper
Developments in Language Theory2005-12-22Paper
Collage of two-dimensional words2005-08-01Paper
Some decision problems on integer matrices2005-06-07Paper
Theory Is Forever2005-01-18Paper
https://portal.mardi4nfdi.de/entity/Q47378922004-08-11Paper
On the number of occurrences of a symbol in words of regular languages.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47821102003-05-12Paper
Minimizing subsequential transducers: a survey.2003-01-22Paper
TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS2002-12-15Paper
Periodicity and roots of transfinite strings2002-09-18Paper
Distances between languages and reflexivity of relations2002-08-13Paper
The commutation of finite sets: A challenging problem2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q44074242002-01-01Paper
A remark on the representation of the free partial commutative monoid2001-11-07Paper
Long words: The theory of concatenation and \(\omega\)-power2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45147352000-11-14Paper
https://portal.mardi4nfdi.de/entity/Q45107942000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q49395972000-03-20Paper
https://portal.mardi4nfdi.de/entity/Q49411482000-02-29Paper
Determinants and Möbius functions in trace monoids2000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q46992961999-11-10Paper
https://portal.mardi4nfdi.de/entity/Q42665211999-10-04Paper
Commutativity in free inverse monoids1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42181431998-11-11Paper
A note on decidability questions on presentations of word semigroups1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43627381997-11-13Paper
Bijective sequential mappings of a free monoid onto another1997-10-30Paper
Logical definability of some rational trace languages1996-03-11Paper
Rational transductions and complexity of counting problems1995-11-14Paper
On Boyer-Moore automata1995-10-09Paper
On the starheight of some rational subsets closed under partial commutations1994-06-13Paper
https://portal.mardi4nfdi.de/entity/Q42815521994-03-10Paper
CONJUGACY IN FREE INVERSE MONOIDS1993-11-01Paper
https://portal.mardi4nfdi.de/entity/Q40367591993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40387131993-05-18Paper
Rational relations and rational series1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40051761992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39712811992-06-25Paper
A remark on the representation of trace monoids1990-01-01Paper
Counting with rational functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38042181988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117181988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37724141987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37890921987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37255601986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427451986-01-01Paper
Test sets for morphisms with bounded delay1985-01-01Paper
On real-time cellular automata and trellis automata1984-01-01Paper
On extendibility of unavoidable sets1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33434641984-01-01Paper
Folding of the plane and the design of systolic arrays1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419321983-01-01Paper
Properties of Finite and Pushdown Transducers1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36810471983-01-01Paper
A closure property of deterministic context-free languages1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30376661981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39531751981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38531351979-01-01Paper
Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38569521978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41567051978-01-01Paper
Sur Certaines Applications Séquentielles Numériques1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41521651977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41095901976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40711751973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Christian Choffrut