Publication | Date of Publication | Type |
---|
Decidability of Definability Issues in the Theory of Real Addition | 2023-03-09 | Paper |
Generalized rational relations and their logical definability | 2022-12-09 | Paper |
Grammic monoids with three generators | 2022-11-23 | Paper |
Rational transductions and complexity of counting problems | 2022-08-18 | Paper |
Grammic monoids with three generators | 2022-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5009704 | 2021-08-05 | Paper |
Decidability of definability issues in the theory of real addition | 2021-02-11 | Paper |
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) | 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 | 2020-02-11 | Paper |
Quasi-automatic semigroups | 2019-06-18 | Paper |
Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉 | 2019-06-14 | Paper |
Two equational theories of partial words | 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 | 2017-03-16 | Paper |
A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid | 2017-02-24 | Paper |
Sequences of words defined by two-way transducers | 2016-12-19 | Paper |
Both Ways Rational Functions | 2016-08-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q5740408 | 2016-07-26 | Paper |
Logical Theory of the Monoid of Languages over a Non Tally Alphabet | 2016-05-11 | Paper |
Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations | 2015-09-22 | Paper |
ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES | 2015-04-23 | Paper |
Logical Theory of the Additive Monoid of Subsets of Natural Integers | 2015-04-14 | Paper |
Deciding Whether or Not a Synchronous Relation is Regular Prefix | 2014-12-22 | Paper |
An Algebraic Characterization of Unary Two-Way Transducers | 2014-10-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5414548 | 2014-05-06 | Paper |
The Lexicographic Cross-Section of the Plactic Monoid Is Regular | 2013-09-20 | Paper |
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem | 2013-06-28 | Paper |
First-order logics: some characterizations and closure properties | 2012-10-15 | Paper |
Rational relations having a rational trace on each finite intersection of rational relations | 2012-10-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q2893298 | 2012-06-20 | Paper |
Unique decipherability in the monoid of languages: an application of rational relations | 2011-10-11 | Paper |
THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES | 2011-03-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575467 | 2010-07-27 | Paper |
On the Expressive Power of FO[ + ] | 2010-05-26 | Paper |
On bounded rational trace languages | 2010-05-10 | Paper |
Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable | 2010-01-29 | Paper |
The decision problem for some logics for finite words on infinite alphabets | 2010-01-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q3396589 | 2009-09-19 | Paper |
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations | 2009-08-18 | Paper |
The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata | 2009-08-07 | Paper |
The Inclusion Problem of Context-Free Languages: Some Tractable Cases | 2009-07-07 | Paper |
Context-Free Grammars and XML Languages | 2009-03-26 | Paper |
Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. | 2009-02-19 | Paper |
Preface | 2008-07-21 | Paper |
Deciding whether a relation defined in Presburger logic can be defined in weaker logics | 2008-07-21 | Paper |
STACS 2004 | 2007-10-01 | Paper |
On the separability of sparse context-free languages and of bounded rational relations | 2007-09-03 | Paper |
Preface | 2007-04-10 | Paper |
Decision problems among the main subfamilies of rational relations | 2007-04-10 | Paper |
Local limit properties for pattern statistics and rational models | 2006-10-25 | Paper |
Developments in Language Theory | 2005-12-22 | Paper |
Collage of two-dimensional words | 2005-08-01 | Paper |
Some decision problems on integer matrices | 2005-06-07 | Paper |
Theory Is Forever | 2005-01-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4737892 | 2004-08-11 | Paper |
On the number of occurrences of a symbol in words of regular languages. | 2003-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4782110 | 2003-05-12 | Paper |
Minimizing subsequential transducers: a survey. | 2003-01-22 | Paper |
TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS | 2002-12-15 | Paper |
Periodicity and roots of transfinite strings | 2002-09-18 | Paper |
Distances between languages and reflexivity of relations | 2002-08-13 | Paper |
The commutation of finite sets: A challenging problem | 2002-07-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4407424 | 2002-01-01 | Paper |
A remark on the representation of the free partial commutative monoid | 2001-11-07 | Paper |
Long words: The theory of concatenation and \(\omega\)-power | 2001-08-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4514735 | 2000-11-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4510794 | 2000-10-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4939597 | 2000-03-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4941148 | 2000-02-29 | Paper |
Determinants and Möbius functions in trace monoids | 2000-01-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4699296 | 1999-11-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4266521 | 1999-10-04 | Paper |
Commutativity in free inverse monoids | 1999-01-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4218143 | 1998-11-11 | Paper |
A note on decidability questions on presentations of word semigroups | 1998-07-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4362738 | 1997-11-13 | Paper |
Bijective sequential mappings of a free monoid onto another | 1997-10-30 | Paper |
Logical definability of some rational trace languages | 1996-03-11 | Paper |
Rational transductions and complexity of counting problems | 1995-11-14 | Paper |
On Boyer-Moore automata | 1995-10-09 | Paper |
On the starheight of some rational subsets closed under partial commutations | 1994-06-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4281552 | 1994-03-10 | Paper |
CONJUGACY IN FREE INVERSE MONOIDS | 1993-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036759 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4038713 | 1993-05-18 | Paper |
Rational relations and rational series | 1992-09-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4005176 | 1992-09-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3971281 | 1992-06-25 | Paper |
A remark on the representation of trace monoids | 1990-01-01 | Paper |
Counting with rational functions | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3804218 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3811718 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3772414 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3789092 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3725560 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3742745 | 1986-01-01 | Paper |
Test sets for morphisms with bounded delay | 1985-01-01 | Paper |
On real-time cellular automata and trellis automata | 1984-01-01 | Paper |
On extendibility of unavoidable sets | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3343464 | 1984-01-01 | Paper |
Folding of the plane and the design of systolic arrays | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3341932 | 1983-01-01 | Paper |
Properties of Finite and Pushdown Transducers | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3681047 | 1983-01-01 | Paper |
A closure property of deterministic context-free languages | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3037666 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3953175 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3853135 | 1979-01-01 | Paper |
Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3856952 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4156705 | 1978-01-01 | Paper |
Sur Certaines Applications Séquentielles Numériques | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4152165 | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4109590 | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4071175 | 1973-01-01 | Paper |