| Publication | Date of Publication | Type |
|---|
| Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time | 2024-02-16 | Paper |
| On bi-infinite and conjugate post correspondence problems | 2024-02-02 | Paper |
| Integer Weighted Automata on Infinite Words | 2023-08-15 | Paper |
| Integer weighted automata on infinite words | 2022-03-25 | Paper |
| A recursive function coding number theoretic functions | 2022-03-17 | Paper |
| On Shuffling a Word with its Letter-to-Letter Substitution | 2021-05-20 | Paper |
| On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem | 2021-03-20 | Paper |
| On fixed points of rational transductions | 2018-06-07 | Paper |
| A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem | 2018-01-19 | Paper |
| Small Semi-Thue System Universal with Respect to the Termination Problem | 2018-01-19 | Paper |
| Walks on tilings of polygons | 2017-12-06 | Paper |
| Similarity relations on words | 2017-10-06 | Paper |
| Weighted automata on infinite words in the context of attacker-defender games | 2017-08-08 | Paper |
| On a geometric problem of zigzags. | 2016-05-26 | Paper |
| On Robot Games of Degree Two | 2016-04-08 | Paper |
| A new proof for the decidability of D0L ultimate periodicity | 2016-03-01 | Paper |
| Weighted Automata on Infinite Words in the Context of Attacker-Defender Games | 2015-10-20 | Paper |
| On the \(n\)-permutation Post correspondence problem | 2015-09-16 | Paper |
| Word problem for deterministic and reversible semi-Thue systems | 2014-06-30 | Paper |
| Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More | 2014-04-02 | Paper |
| New proof for the undecidability of the circular PCP | 2013-11-11 | Paper |
| Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem | 2013-09-20 | Paper |
| Decision Problems for Probabilistic Finite Automata on Bounded Languages | 2013-04-18 | Paper |
| REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM | 2011-03-30 | Paper |
| UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES | 2011-01-06 | Paper |
| On the Periodicity of Morphic Words | 2010-08-31 | Paper |
| On the Joint Spectral Radius for Bounded Matrix Languages | 2010-08-31 | Paper |
| Post correspondence problem for short words | 2010-06-09 | Paper |
| Square-free partial words | 2010-06-09 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| On the number of squares in partial words | 2010-03-12 | Paper |
| Equality sets of prefix morphisms and regular star languages | 2009-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396566 | 2009-09-19 | Paper |
| On Post correspondence problem for letter monotonic languages | 2009-08-07 | Paper |
| The theorem of Fine and Wilf for relational periods | 2009-05-06 | Paper |
| Overlap-freeness in infinite partial words | 2009-03-17 | Paper |
| MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387733 | 2008-05-27 | Paper |
| Defect theorems with compatibility relations. | 2008-04-03 | Paper |
| Relational codes of words | 2008-01-07 | Paper |
| On Markov's undecidability theorem for integer matrices. | 2007-11-14 | Paper |
| Improved matrix pair undecidability results | 2007-08-17 | Paper |
| Extension of the decidability of the marked PCP to instances with unique blocks | 2007-07-16 | Paper |
| Undecidability of infinite post correspondence problem for instances of Size 9 | 2007-02-20 | 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 |
| Positivity of second order linear recurrent sequences | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5716610 | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665745 | 2005-04-11 | Paper |
| Undecidability in matrices over Laurent polynomials. | 2005-01-26 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737917 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738288 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453473 | 2004-03-07 | Paper |
| Decidability of the binary infinite Post Correspondence Problem | 2003-09-22 | Paper |
| Mortality in Matrix Semigroups | 2002-09-05 | Paper |
| Binary (generalized) Post Correspondence Problem | 2002-07-15 | Paper |
| Marked PCP is decidable | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729239 | 2001-07-18 | Paper |
| GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510798 | 2001-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934339 | 2000-10-03 | Paper |
| Periods and binary words | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941153 | 2000-02-29 | Paper |
| Undecidability of the equivalence of finite substitutions on regular language | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265634 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251052 | 1999-06-17 | Paper |
