| Publication | Date of Publication | Type |
|---|
Decidability of Definability Issues in the Theory of Real Addition
Fundamenta Informaticae | 2023-03-09 | Paper |
Generalized rational relations and their logical definability
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Grammic monoids with three generators
Semigroup Forum | 2022-11-23 | Paper |
Rational transductions and complexity of counting problems
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Grammic monoids with three generators
(available as arXiv preprint) | 2022-07-26 | Paper |
scientific article; zbMATH DE number 7379289 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-05 | Paper |
Decidability of definability issues in the theory of real addition
(available as arXiv preprint) | 2021-02-11 | Paper |
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\)
Algebra Universalis | 2020-08-12 | Paper |
| \(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\) | 2020-07-27 | Paper |
Theories of real addition with and without a predicate for integers
(available as arXiv preprint) | 2020-02-11 | Paper |
Quasi-automatic semigroups
Theoretical Computer Science | 2019-06-18 | Paper |
Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
Fundamenta Informaticae | 2019-06-14 | Paper |
Two equational theories of partial words
Theoretical Computer Science | 2018-06-18 | Paper |
| Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals | 2018-05-08 | Paper |
An Hadamard operation on rational relations
Theoretical Computer Science | 2017-03-16 | Paper |
A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid
Semigroup Forum | 2017-02-24 | Paper |
Sequences of words defined by two-way transducers
Theoretical Computer Science | 2016-12-19 | Paper |
Both ways rational functions
Developments in Language Theory | 2016-08-30 | Paper |
| scientific article; zbMATH DE number 6606339 (Why is no real title available?) | 2016-07-26 | Paper |
Logical theory of the monoid of languages over a non tally alphabet
Fundamenta Informaticae | 2016-05-11 | Paper |
Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
Fields of Logic and Computation II | 2015-09-22 | Paper |
On the decidability of the intersection problem for quantum automata and context-free languages
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Logical Theory of the Additive Monoid of Subsets of Natural Integers
Automata, Universality, Computation | 2015-04-14 | Paper |
Deciding Whether or Not a Synchronous Relation is Regular Prefix
Fundamenta Informaticae | 2014-12-22 | Paper |
An algebraic characterization of unary two-way transducers
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| Contextual partial commutations | 2014-05-06 | Paper |
The lexicographic cross-section of the plactic monoid is regular
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Quantum finite automata and linear context-free languages: a decidable problem
Developments in Language Theory | 2013-06-28 | Paper |
First-order logics: some characterizations and closure properties
Acta Informatica | 2012-10-15 | Paper |
Rational relations having a rational trace on each finite intersection of rational relations
Theoretical Computer Science | 2012-10-11 | Paper |
A note on the logical definability of rational trace languages
Fundamenta Informaticae | 2012-06-20 | Paper |
Unique decipherability in the monoid of languages: an application of rational relations
Theory of Computing Systems | 2011-10-11 | Paper |
The inclusion problem of context-free languages: some tractable cases
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
| scientific article; zbMATH DE number 5761834 (Why is no real title available?) | 2010-07-27 | Paper |
On the expressive power of FO[+]
Language and Automata Theory and Applications | 2010-05-26 | Paper |
On bounded rational trace languages
Theory of Computing Systems | 2010-05-10 | Paper |
Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
Information Processing Letters | 2010-01-29 | Paper |
The decision problem for some logics for finite words on infinite alphabets
Journal of Mathematical Sciences (New York) | 2010-01-15 | Paper |
| scientific article; zbMATH DE number 5605092 (Why is no real title available?) | 2009-09-19 | Paper |
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
Computer Science - Theory and Applications | 2009-08-18 | Paper |
The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
Theoretical Computer Science | 2009-08-07 | Paper |
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
Developments in Language Theory | 2009-07-07 | Paper |
Context-Free Grammars and XML Languages
Developments in Language Theory | 2009-03-26 | Paper |
Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Theoretical Computer Science | 2009-02-19 | Paper |
Preface
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
On the separability of sparse context-free languages and of bounded rational relations
Theoretical Computer Science | 2007-09-03 | Paper |
Preface
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Preface
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Decision problems among the main subfamilies of rational relations
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Decision problems among the main subfamilies of rational relations
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Decision problems among the main subfamilies of rational relations
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Local limit properties for pattern statistics and rational models
Theory of Computing Systems | 2006-10-25 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Collage of two-dimensional words
Theoretical Computer Science | 2005-08-01 | Paper |
Some decision problems on integer matrices
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Some decision problems on integer matrices
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
| scientific article; zbMATH DE number 2087209 (Why is no real title available?) | 2004-08-11 | Paper |
On the number of occurrences of a symbol in words of regular languages.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1836425 (Why is no real title available?) | 2003-05-12 | Paper |
Minimizing subsequential transducers: a survey.
Theoretical Computer Science | 2003-01-22 | Paper |
TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS
International Journal of Algebra and Computation | 2002-12-15 | Paper |
Periodicity and roots of transfinite strings
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Periodicity and roots of transfinite strings
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Periodicity and roots of transfinite strings
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Distances between languages and reflexivity of relations
Theoretical Computer Science | 2002-08-13 | Paper |
The commutation of finite sets: A challenging problem
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1944116 (Why is no real title available?) | 2002-01-01 | Paper |
A remark on the representation of the free partial commutative monoid
Séminaire Lotharingien de Combinatoire | 2001-11-07 | Paper |
Long words: The theory of concatenation and \(\omega\)-power
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1530301 (Why is no real title available?) | 2000-11-14 | Paper |
| scientific article; zbMATH DE number 1522559 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1400044 (Why is no real title available?) | 2000-03-20 | Paper |
| scientific article; zbMATH DE number 1408334 (Why is no real title available?) | 2000-02-29 | Paper |
Determinants and Möbius functions in trace monoids
Discrete Mathematics | 2000-01-31 | Paper |
| scientific article; zbMATH DE number 1361478 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1346498 (Why is no real title available?) | 1999-10-04 | Paper |
Commutativity in free inverse monoids
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1222601 (Why is no real title available?) | 1998-11-11 | Paper |
A note on decidability questions on presentations of word semigroups
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1086500 (Why is no real title available?) | 1997-11-13 | Paper |
Bijective sequential mappings of a free monoid onto another
RAIRO - Theoretical Informatics and Applications | 1997-10-30 | Paper |
Logical definability of some rational trace languages
Mathematical Systems Theory | 1996-03-11 | Paper |
Rational transductions and complexity of counting problems
Mathematical Systems Theory | 1995-11-14 | Paper |
On Boyer-Moore automata
Algorithmica | 1995-10-09 | Paper |
On the starheight of some rational subsets closed under partial commutations
Information and Computation | 1994-06-13 | Paper |
| scientific article; zbMATH DE number 512855 (Why is no real title available?) | 1994-03-10 | Paper |
CONJUGACY IN FREE INVERSE MONOIDS
International Journal of Algebra and Computation | 1993-11-01 | Paper |
| scientific article; zbMATH DE number 177835 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176925 (Why is no real title available?) | 1993-05-18 | Paper |
Rational relations and rational series
Theoretical Computer Science | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 58290 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 8792 (Why is no real title available?) | 1992-06-25 | Paper |
A remark on the representation of trace monoids
Semigroup Forum | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4080924 (Why is no real title available?) | 1988-01-01 | Paper |
Counting with rational functions
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4072416 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4053049 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4031964 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3978420 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3956458 (Why is no real title available?) | 1986-01-01 | Paper |
Test sets for morphisms with bounded delay
Discrete Applied Mathematics | 1985-01-01 | Paper |
On extendibility of unavoidable sets
Discrete Applied Mathematics | 1984-01-01 | Paper |
On real-time cellular automata and trellis automata
Acta Informatica | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3878386 (Why is no real title available?) | 1984-01-01 | Paper |
Properties of Finite and Pushdown Transducers
SIAM Journal on Computing | 1983-01-01 | Paper |
Folding of the plane and the design of systolic arrays
Information Processing Letters | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3876632 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3902928 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3772958 (Why is no real title available?) | 1981-01-01 | Paper |
A closure property of deterministic context-free languages
Information Processing Letters | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3830208 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3653575 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3586941 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3586941 (Why is no real title available?) | 1978-01-01 | Paper |
Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
Theoretical Computer Science | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3658049 (Why is no real title available?) | 1978-01-01 | Paper |
Sur Certaines Applications Séquentielles Numériques
Information and Control | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3583719 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3532857 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3487375 (Why is no real title available?) | 1973-01-01 | Paper |
Equational theory of ordinals with addition and left multiplication by $\omega$
(available as arXiv preprint) | N/A | Paper |
