| Publication | Date of Publication | Type |
|---|
| Comparing descriptional and computational complexity of infinite words | 2024-01-29 | Paper |
| Toeplitz words, generalized periodicity and periodically iterated morphisms | 2023-12-12 | Paper |
| Systems of equations over a finite set of words and automata theory | 2023-08-14 | Paper |
| Regularity of k-Abelian Equivalence Classes of Fixed Cardinality | 2023-06-30 | Paper |
| Pattern-matching problems for 2-dimensional images described by finite automata | 2022-12-09 | Paper |
| Iterative devices generating infinite words | 2022-08-18 | Paper |
| On computational power of weighted finite automata | 2022-08-18 | Paper |
| On the size of independent systems of equations in semigroups | 2022-08-18 | Paper |
| On the equivalence problem for deterministic multitape automata and transducers | 2022-08-16 | Paper |
| Finite transducers and rational transductions | 2022-02-04 | Paper |
| Finite automata, image manipulation, and automatic real functions | 2021-11-12 | Paper |
| Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata | 2021-05-20 | Paper |
| On Abelian Closures of Infinite Non-binary Words | 2020-12-29 | Paper |
| A compactness property of the \(k\)-abelian monoids | 2020-08-17 | Paper |
| On abelian saturated infinite words | 2019-10-07 | Paper |
| Compactness of systems of equations in semigroups | 2019-01-10 | Paper |
| On abelian subshifts | 2018-11-22 | Paper |
| Degrees of Infinite Words, Polynomials and Atoms | 2018-09-20 | Paper |
| The expressibility of languages and relations by word equations | 2018-07-04 | Paper |
| On \(k\)-abelian palindromes | 2018-05-30 | Paper |
| k-Abelian Equivalence and Rationality | 2018-01-19 | Paper |
| Remarks on generalized Post Correspondence Problem | 2017-11-16 | Paper |
| On growth and fluctuation of \(k\)-abelian complexity | 2017-08-31 | Paper |
| Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence | 2017-08-25 | Paper |
| On cardinalities of \(k\)-abelian equivalence classes | 2016-12-19 | Paper |
| k-Abelian Equivalence and Rationality | 2016-08-30 | Paper |
| Degrees of Infinite Words, Polynomials and Atoms | 2016-08-30 | Paper |
| On Growth and Fluctuation of k-Abelian Complexity | 2015-10-20 | Paper |
| On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages | 2015-09-08 | Paper |
| Reachability via Cooperating Morphisms | 2015-03-23 | Paper |
| On k-Abelian Palindromic Rich and Poor Words | 2014-10-14 | Paper |
| Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence | 2014-10-14 | Paper |
| On maximal chains of systems of word equations | 2014-08-04 | Paper |
| FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS | 2014-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414545 | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5404289 | 2014-03-24 | Paper |
| On a generalization of abelian equivalence and complexity of infinite words | 2014-01-06 | Paper |
| On \(k\)-abelian avoidability | 2013-11-04 | Paper |
| Fine and Wilf’s Theorem for k-Abelian Periods | 2012-11-02 | Paper |
| Equations in the Partial Semigroup of Words with Overlapping Products | 2012-11-01 | Paper |
| Problems in between words and abelian words: \(k\)-abelian avoidability | 2012-10-11 | Paper |
| On abelian versions of critical factorization theorem | 2012-08-31 | Paper |
| Preface | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3100920 | 2011-11-22 | Paper |
| The Unique Decipherability in the Monoid of Regular Languages is Undecidable | 2011-11-22 | Paper |
| Locally catenative sequences and Turtle graphics | 2011-10-28 | Paper |
| Unique decipherability in the monoid of languages: an application of rational relations | 2011-10-11 | Paper |
| Weighted Finite Automata: Computing with Different Topologies | 2011-06-17 | Paper |
| Local Squares, Periodicity and Finite Automata | 2011-05-27 | Paper |
| Observations and Problems on k-abelian avoidability | 2011-04-21 | Paper |
| Computational power of two stacks with restricted communication | 2010-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575485 | 2010-07-27 | Paper |
| Post correspondence problem for short words | 2010-06-09 | Paper |
| Automata on Words | 2010-05-07 | Paper |
| On stateless multihead automata: hierarchies and the emptiness problem | 2010-02-05 | Paper |
| INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE | 2010-01-29 | Paper |
| Computing partial information out of intractable: powers of algebraic numbers as an example | 2010-01-08 | Paper |
| ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS | 2009-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395963 | 2009-09-15 | Paper |
| Unique Decipherability in the Monoid of Languages: An Application of Rational Relations | 2009-08-18 | Paper |
| Conjugacy of finite biprefix codes | 2009-06-04 | Paper |
| Aspects of Molecular Computing | 2009-05-14 | Paper |
| MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM | 2009-02-10 | Paper |
| An Analysis and a Reproof of Hmelevskii’s Theorem | 2008-10-30 | Paper |
| Binary operations on automatic functions | 2008-07-29 | Paper |
| Tiling Periodicity | 2008-06-17 | Paper |
| ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS | 2008-05-20 | Paper |
| On Stateless Multihead Automata: Hierarchies and the Emptiness Problem | 2008-04-15 | Paper |
| Communication of Two Stacks and Rewriting | 2007-09-11 | Paper |
| Extension of the decidability of the marked PCP to instances with unique blocks | 2007-07-16 | Paper |
| The structure of infinite solutions of marked and binary Post correspondence problems | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409982 | 2006-11-21 | Paper |
| Computing by commuting. | 2006-05-18 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| The Equivalence Problem of Finite Substitutions on ab*c, with Applications | 2005-10-19 | Paper |
| Commutation with codes | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024808 | 2005-07-04 | Paper |
| On the complexity of decidable cases of the commutation problem of languages | 2005-06-30 | Paper |
| A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM | 2005-06-22 | Paper |
| Some decision problems on integer matrices | 2005-06-07 | Paper |
| Commutation with ternary sets of words | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665742 | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665743 | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662028 | 2005-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662840 | 2005-03-30 | Paper |
| A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) | 2004-11-23 | Paper |
| Many aspects of defect theorems | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737210 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737905 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738289 | 2004-08-11 | Paper |
| Polynomial versus exponential growth in repetition-free binary words | 2004-08-06 | Paper |
| Decidability of the binary infinite Post Correspondence Problem | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418638 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708961 | 2003-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708962 | 2003-06-26 | Paper |
| The expressibility of languages and relations by word equations | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708557 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708580 | 2003-06-18 | Paper |
| Some decision problems concerning semilinearity and commutation. | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782110 | 2003-05-12 | Paper |
| Locally periodic versus globally periodic infinite words | 2003-03-26 | Paper |
| The complexity of compressing subsegments of images described by finite automata | 2003-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743689 | 2003-02-04 | Paper |
| A defect theorem for bi-infinite words. | 2003-01-22 | Paper |
| Conway's problem for three-word sets. | 2003-01-21 | Paper |
| Communication complexity method for measuring nondeterminism in finite automata | 2003-01-14 | Paper |
| A short biography of Arto Salomaa | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782693 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782709 | 2002-12-02 | Paper |
| On Conjugacy of Languages | 2002-09-18 | Paper |
| The commutation of finite sets: A challenging problem | 2002-07-15 | Paper |
| Multiple factorizations of words and defect effect | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535049 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529991 | 2002-05-07 | Paper |
| On the expressibility of languages by word equations with a bounded number of variables | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762520 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754174 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754144 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2742579 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500842 | 2001-04-19 | Paper |
| ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510794 | 2000-10-30 | Paper |
| A short biography of Arto Salomaa | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941141 | 2000-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941151 | 2000-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265617 | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265629 | 1999-09-22 | Paper |
| Generalized factorizations of words and their algorithmic properties | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218145 | 1999-06-21 | Paper |
| Examples of undecidable problems for 2-generator matrix semigroups | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219037 | 1998-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362735 | 1998-11-03 | Paper |
| ITERATIVE DEVICES GENERATING INFINITE WORDS | 1998-11-02 | Paper |
| A note on decidability questions on presentations of word semigroups | 1998-07-22 | Paper |
| Compactness of Systems of Equations in Semigroups | 1998-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347966 | 1997-11-24 | Paper |
| On continuous functions computed by finite automata | 1997-10-30 | Paper |
| Toeplitz words, generalized periodicity and periodically iterated morphisms | 1997-08-07 | Paper |
| On the size of independent systems of equations in semigroups | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874657 | 1996-08-22 | Paper |
| Polynomial size test sets for context-free languages | 1996-03-18 | Paper |
| Finite Automata Computing Real Functions | 1994-10-17 | Paper |
| Efficient constructions of test sets for regular and context-free languages | 1993-10-25 | Paper |
| Equations over finite sets of words and equivalence problems in automata theory | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035247 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036760 | 1993-05-18 | Paper |
| Multiplicities: A deterministic view of nondeterminism | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975141 | 1992-06-26 | Paper |
| The equivalence problem of multitape finite automata | 1991-01-01 | Paper |
| On the power of synchronization in parallel computations | 1991-01-01 | Paper |
| Loops in automata and HDTOL relations | 1990-01-01 | Paper |
| HDTOL matching of computations of multitape automata | 1989-01-01 | Paper |
| On totalistic systolic networks | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793751 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817618 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3769982 | 1987-01-01 | Paper |
| The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773369 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777487 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782812 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782819 | 1987-01-01 | Paper |
| On morphic generation of regular languages | 1986-01-01 | Paper |
| A note on the equivalence problem of rational formal power series | 1986-01-01 | Paper |
| On the defect theorem and simplifiability | 1986-01-01 | Paper |
| The equivalence of finite valued transducers (on HDT0L languages) is decidable | 1986-01-01 | Paper |
| A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language | 1986-01-01 | Paper |
| Synchronizable deterministic pushdown automata and the decidability of their equivalence | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711770 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4728263 | 1986-01-01 | Paper |
| On three-element codes | 1985-01-01 | Paper |
| Test sets for morphisms with bounded delay | 1985-01-01 | Paper |
| A property of three-element codes | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3736916 | 1985-01-01 | Paper |
| A note on intersections of free submonoids of a free monoid | 1984-01-01 | Paper |
| The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids | 1984-01-01 | Paper |
| Inverse morphic equivalence on languages | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217628 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219110 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340178 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343463 | 1984-01-01 | Paper |
| Systems of equations over a free monoid and Ehrenfeucht's conjecture | 1983-01-01 | Paper |
| On binary equality sets and a solution to the test set conjecture in the binary case | 1983-01-01 | Paper |
| A note on morphic characterization of languages | 1983-01-01 | Paper |
| On cube-free \(\omega\)-words generated by binary morphisms | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041425 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334093 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341932 | 1983-01-01 | Paper |
| The (generalized) Post correspondence problem with lists consisting of two words is decidable | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325060 | 1982-01-01 | Paper |
| Test sets for context free languages and algebraic systems of equations over a free monoid | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945604 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945605 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912049 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912050 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933776 | 1981-01-01 | Paper |
| On the equivalence problem for binary DOL systems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3901701 | 1980-01-01 | Paper |
| Generalized Parikh mappings and homomorphisms | 1980-01-01 | Paper |
| On commutative DTOL systems | 1979-01-01 | Paper |
| Interactive L systems with almost interactionless behaviour | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3906444 | 1979-01-01 | Paper |
| Remarks on commutative N-rational series | 1978-01-01 | Paper |
| A note on DOL length sets | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131689 | 1977-01-01 | Paper |
| Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\) | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4128031 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4054679 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055222 | 1974-01-01 | Paper |
| An example of a PD2L-system with the growth type 2\({1 \over 2}\) | 1973-01-01 | Paper |
| On Abelian Closures of Infinite Non-binary Words | 0001-01-03 | Paper |
