| Publication | Date of Publication | Type |
|---|
Commuting upper triangular binary morphisms
Fundamenta Informaticae | 2024-10-07 | Paper |
Rational power series in several noncommuting variables and the Skolem-Mahler-Lech theorem
Theoretical Computer Science | 2024-04-17 | Paper |
An iteration property of Lindenmayerian power series
Lecture Notes in Computer Science | 2024-01-29 | Paper |
ON SPARSE 0L LANGUAGES OVER THE BINARY ALPHABET
Words, Semigroups, and Transductions | 2022-12-06 | Paper |
Lindenmayer systems
Monographs in Theoretical Computer Science | 2022-04-28 | Paper |
Quasi-universal \(k\)-regular sequences
Theoretical Computer Science | 2021-10-21 | Paper |
A characterization of free pairs of upper triangular free monoid morphisms
Information and Computation | 2019-05-29 | Paper |
Equality sets of binary D0L sequences
Theoretical Computer Science | 2018-06-08 | Paper |
A new bound for the D0L language equivalence problem
Acta Informatica | 2018-02-28 | Paper |
D0L sequences and their equality sets
Fundamenta Informaticae | 2018-01-19 | Paper |
Discrete Watson-Crick dynamical systems
Theoretical Computer Science | 2017-12-06 | Paper |
Rational series with high image complexity
RAIRO - Theoretical Informatics and Applications | 2017-09-04 | Paper |
Ultimately periodic languages
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Remarks concerning the freeness problem over morphism and matrix semigroups.
Theoretical Computer Science | 2016-06-27 | Paper |
Language-theoretic problems in certain matrix monoids
Theoretical Computer Science | 2015-09-16 | Paper |
The finiteness problem for monoids of morphisms.
RAIRO - Theoretical Informatics and Applications | 2015-04-15 | Paper |
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices
Information and Computation | 2014-11-28 | Paper |
Products of matrices and recursively enumerable sets
Journal of Computer and System Sciences | 2014-11-24 | Paper |
The freeness problem over matrix semigroups and bounded languages
Information and Computation | 2014-07-18 | Paper |
Equality sets of morphic word sequences
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
The sequence equivalence problem for primitive D0L systems
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Marked D0L systems and the \(2n\)-conjecture
Theoretical Computer Science | 2012-06-25 | Paper |
A characterization of regular languages as equality sets of HDT0L sequences
Fundamenta Informaticae | 2012-06-20 | Paper |
A characterization of rational D0L power series
Acta Informatica | 2012-03-23 | Paper |
The cyclicity problem for the images of \(q\)-rational series
RAIRO - Theoretical Informatics and Applications | 2012-02-28 | Paper |
The sequence equivalence problem for marked DT0L systems
Fundamenta Informaticae | 2011-11-22 | Paper |
The equality problem for purely substitutive words
Combinatorics, Automata and Number Theory | 2011-04-18 | Paper |
The class of HDT0L sequences is closed with respect to rational functions
Information Processing Letters | 2009-12-04 | Paper |
| scientific article; zbMATH DE number 5605100 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5604071 (Why is no real title available?) | 2009-09-15 | Paper |
| scientific article; zbMATH DE number 5604086 (Why is no real title available?) | 2009-09-15 | Paper |
The equality problem for infinite words generated by primitive morphisms
Information and Computation | 2009-07-15 | Paper |
NUMBER SYSTEMS AND THE INJECTIVITY PROBLEM FOR MATRIX REPRESENTATIONS OF FREE MONOIDS
International Journal of Algebra and Computation | 2009-06-30 | Paper |
On the simplification of infinite morphic words
Theoretical Computer Science | 2009-03-17 | Paper |
Sparse and slender subsets of monoids.
Semigroup Forum | 2008-04-03 | Paper |
Cancellation and periodicity properties of iterated morphisms
Theoretical Computer Science | 2008-03-05 | Paper |
| scientific article; zbMATH DE number 5236696 (Why is no real title available?) | 2008-02-18 | Paper |
A periodicity property of iterated morphisms
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
A periodicity property of iterated morphisms
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
A periodicity property of iterated morphisms
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
| On the simplification of HD0L power series | 2007-10-25 | Paper |
THE D0L ω-EQUIVALENCE PROBLEM
International Journal of Foundations of Computer Science | 2007-03-13 | Paper |
A new bound for the D0L sequence equivalence problem
Acta Informatica | 2007-01-05 | Paper |
| On the problem whether the image of an \(N\)-rational series equals \(N\) | 2006-11-21 | Paper |
THE BASE PROBLEM FOR D0L PARIKH SETS
International Journal of Foundations of Computer Science | 2006-05-10 | Paper |
An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
Journal of Computer and System Sciences | 2005-12-07 | Paper |
The equivalence problem for languages defined by transductions on D0L languages
International Journal of Computer Mathematics | 2005-07-27 | Paper |
REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
Journal of Number Theory | 2005-04-28 | Paper |
| scientific article; zbMATH DE number 2155199 (Why is no real title available?) | 2005-04-11 | Paper |
The language equivalence problem for HD0L systems having D0L growths
Theoretical Computer Science | 2005-02-22 | Paper |
A bound for theω-equivalence problem of polynomial D0L systems
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
A bound for theω-equivalence problem of polynomial D0L systems
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Decidability questions related to abstract numeration systems
Discrete Mathematics | 2004-08-19 | Paper |
Bounds for the D0L language equivalence problem
Information and Computation | 2004-08-06 | Paper |
On the Images of ℕ-Rational Sequences Counting Multiplicities
International Journal of Algebra and Computation | 2004-08-06 | Paper |
On infinite HD0L words having sparse letters
International Journal of Computer Mathematics | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2059844 (Why is no real title available?) | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 2050941 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2016846 (Why is no real title available?) | 2003-12-14 | Paper |
The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
Theory of Computing Systems | 2003-08-26 | Paper |
On images of D0L and DT0L power series.
Theoretical Computer Science | 2003-08-17 | Paper |
Decidability results for Watson-Crick D0L systems with nonregular triggers.
Theoretical Computer Science | 2003-08-17 | Paper |
The equivalence problem for DF0L languages and power series.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
The equality problem for Parikh simple algebraic power series.
Information Processing Letters | 2003-01-21 | Paper |
RESULTS CONCERNING THINNESS OF D0L LANGUAGES
International Journal of Algebra and Computation | 2002-12-15 | Paper |
| scientific article; zbMATH DE number 1819637 (Why is no real title available?) | 2002-12-10 | Paper |
On number systems with finite degree of ambiguity
Information and Computation | 2002-11-24 | Paper |
On n-algebraic power series having polynomial growths11
Communications in Algebra | 2002-11-14 | Paper |
A polynomial bound for certain cases of the D0L sequence equivalence problem
Theory of Computing Systems | 2002-06-30 | Paper |
On infinite words generated by polynomial D0L systems
Discrete Applied Mathematics | 2002-03-06 | Paper |
| scientific article; zbMATH DE number 1512077 (Why is no real title available?) | 2001-09-04 | Paper |
On D0L and HDT0L sets in monoids
Semigroup Forum | 2001-08-27 | Paper |
Watson-Crick D0L systems with regular triggers
Theoretical Computer Science | 2001-08-20 | Paper |
On Parikh slender context-free languages
Theoretical Computer Science | 2001-08-20 | Paper |
Zeros of \(\mathbb{Z}\)-rational sequences and thin 0L languages
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
Results concerning E0L and C0L power series
Acta Cybernetica | 2001-06-13 | Paper |
| scientific article; zbMATH DE number 1542849 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1542829 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1542861 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1543062 (Why is no real title available?) | 2001-02-26 | Paper |
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
RAIRO - Theoretical Informatics and Applications | 2001-02-11 | Paper |
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
RAIRO - Theoretical Informatics and Applications | 2001-02-11 | Paper |
| scientific article; zbMATH DE number 1860693 (Why is no real title available?) | 2001-01-01 | Paper |
Easy cases of the D0L sequence equivalence problem
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1860695 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1408340 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1501608 (Why is no real title available?) | 2000-09-04 | Paper |
A short solution for the HDT0L sequence equivalence problem
Theoretical Computer Science | 2000-08-21 | Paper |
On D0L power series
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1419226 (Why is no real title available?) | 2000-07-20 | Paper |
On slender 0L languages over the binary alphabet
Acta Informatica | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1418476 (Why is no real title available?) | 2000-03-19 | Paper |
On the equivalence problem of context-free and DT0L languages
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1339971 (Why is no real title available?) | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1346366 (Why is no real title available?) | 1999-09-30 | Paper |
On Sequences Defined by D0L Power Series
RAIRO - Theoretical Informatics and Applications | 1999-09-22 | Paper |
On Sequences Defined by D0L Power Series
RAIRO - Theoretical Informatics and Applications | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1267565 (Why is no real title available?) | 1999-06-20 | Paper |
Decision problems concerning thinness and slenderness of formal languages
Acta Informatica | 1999-01-11 | Paper |
On Lindenmayerian algebraic power series
Theoretical Computer Science | 1998-07-22 | Paper |
On Lindenmayerian algebraic sequences
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1156871 (Why is no real title available?) | 1998-05-26 | Paper |
| scientific article; zbMATH DE number 1086498 (Why is no real title available?) | 1997-12-14 | Paper |
On the Decidability of Some Equivalence Problems for L Algebraic Series
International Journal of Algebra and Computation | 1997-10-06 | Paper |
On lindenmayerian rational subsets of monoids
RAIRO - Theoretical Informatics and Applications | 1997-08-14 | Paper |
A decision method for Parikh slenderness of context-free languages
Discrete Applied Mathematics | 1997-06-30 | Paper |
| scientific article; zbMATH DE number 938517 (Why is no real title available?) | 1997-02-03 | Paper |
| scientific article; zbMATH DE number 871241 (Why is no real title available?) | 1996-08-13 | Paper |
On Parikh slender languages and power series
Journal of Computer and System Sciences | 1996-07-16 | Paper |
| scientific article; zbMATH DE number 1419240 (Why is no real title available?) | 1996-01-01 | Paper |
On generalized DT0L systems and their fixed points
Theoretical Computer Science | 1995-11-06 | Paper |
On morphically generated formal power series
RAIRO - Theoretical Informatics and Applications | 1995-05-01 | Paper |
On D0L systems with immigration
Theoretical Computer Science | 1994-11-29 | Paper |
| scientific article; zbMATH DE number 176764 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176924 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 168432 (Why is no real title available?) | 1993-05-16 | Paper |
Caractérisation results about $L$ codes
RAIRO - Theoretical Informatics and Applications | 1992-09-27 | Paper |
On generalized zeta functions of formal languages and series
Discrete Applied Mathematics | 1992-06-26 | Paper |
On algebraic generalized zeta functions of formal power series
Theoretical Computer Science | 1991-01-01 | Paper |
On number systems with negative digits
Annales Academiae Scientiarum Fennicae Series A I Mathematica | 1989-01-01 | Paper |
A necessary condition for the rationality of the zeta function of a regular language
Theoretical Computer Science | 1989-01-01 | Paper |
A defect property of codes with unbounded delays
Discrete Applied Mathematics | 1988-01-01 | Paper |
It is decidable whether or not a permutation-free morphism is an l code
International Journal of Computer Mathematics | 1987-01-01 | Paper |
A decision method for the recognizability of sets defined by number systems
RAIRO - Theoretical Informatics and Applications | 1986-01-01 | Paper |
Bases and ambiguity of number systems
Theoretical Computer Science | 1984-01-01 | Paper |
Unique representation in number systems and L codes
Discrete Applied Mathematics | 1982-01-01 | Paper |
