| Publication | Date of Publication | Type |
|---|
Decision problems on copying and shuffling
Fundamenta Informaticae | 2024-10-07 | Paper |
On simulating Turing machines with matrix semigroups with integrality tests
Theoretical Computer Science | 2024-06-27 | Paper |
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time
International Journal of Foundations of Computer Science | 2024-02-16 | Paper |
On bi-infinite and conjugate post correspondence problems
RAIRO - Theoretical Informatics and Applications | 2024-02-02 | Paper |
Integer Weighted Automata on Infinite Words
International Journal of Foundations of Computer Science | 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
Fundamenta Informaticae | 2021-05-20 | Paper |
On the steps of Emil Post: from normal systems to the correspondence decision problem
Acta Cybernetica | 2021-03-20 | Paper |
On fixed points of rational transductions
Theoretical Computer Science | 2018-06-07 | Paper |
Small Semi-Thue System Universal with Respect to the Termination Problem
Fundamenta Informaticae | 2018-01-19 | Paper |
A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem
Fundamenta Informaticae | 2018-01-19 | Paper |
Walks on tilings of polygons
Theoretical Computer Science | 2017-12-06 | Paper |
Similarity relations on words
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
Weighted automata on infinite words in the context of attacker-defender games
Information and Computation | 2017-08-08 | Paper |
On a geometric problem of zigzags.
Information Processing Letters | 2016-05-26 | Paper |
On robot games of degree two
Language and Automata Theory and Applications | 2016-04-08 | Paper |
A new proof for the decidability of D0L ultimate periodicity
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Weighted automata on infinite words in the context of attacker-defender games
Evolving Computability | 2015-10-20 | Paper |
On the \(n\)-permutation Post correspondence problem
Theoretical Computer Science | 2015-09-16 | Paper |
Word problem for deterministic and reversible semi-Thue systems
Semigroup Forum | 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
Acta Informatica | 2013-11-11 | Paper |
Deterministic semi-Thue systems and variants of Post correspondence problem
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Decision problems for probabilistic finite automata on bounded languages
Fundamenta Informaticae | 2013-04-18 | Paper |
Reduction tree of the binary generalized post correspondence problem
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Undecidability bounds for integer matrices using Claus instances
International Journal of Foundations of Computer Science | 2011-01-06 | Paper |
On the periodicity of morphic words
Developments in Language Theory | 2010-08-31 | Paper |
On the joint spectral radius for bounded matrix languages
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Square-free partial words
Information Processing Letters | 2010-06-09 | Paper |
Post correspondence problem for short words
Information Processing Letters | 2010-06-09 | Paper |
Languages defined by generalized equality sets.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On the number of squares in partial words
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Equality sets of prefix morphisms and regular star languages
Information Processing Letters | 2009-12-04 | Paper |
scientific article; zbMATH DE number 5605069 (Why is no real title available?)
| 2009-09-19 | Paper |
On Post correspondence problem for letter monotonic languages
Theoretical Computer Science | 2009-08-07 | Paper |
The theorem of Fine and Wilf for relational periods
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Overlap-freeness in infinite partial words
Theoretical Computer Science | 2009-03-17 | Paper |
MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
International Journal of Algebra and Computation | 2009-02-10 | Paper |
Interaction properties of relational periods
| 2008-05-27 | Paper |
Defect theorems with compatibility relations.
Semigroup Forum | 2008-04-03 | Paper |
Relational codes of words
Theoretical Computer Science | 2008-01-07 | Paper |
On Markov's undecidability theorem for integer matrices.
Semigroup Forum | 2007-11-14 | Paper |
Improved matrix pair undecidability results
Acta Informatica | 2007-08-17 | Paper |
Extension of the decidability of the marked PCP to instances with unique blocks
Theoretical Computer Science | 2007-07-16 | Paper |
Undecidability of infinite post correspondence problem for instances of Size 9
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
The structure of infinite solutions of marked and binary Post correspondence problems
Theory of Computing Systems | 2007-02-14 | Paper |
scientific article; zbMATH DE number 5074397 (Why is no real title available?)
| 2006-11-21 | Paper |
Positivity of second order linear recurrent sequences
Discrete Applied Mathematics | 2006-04-28 | Paper |
scientific article; zbMATH DE number 2245556 (Why is no real title available?)
| 2006-01-10 | Paper |
scientific article; zbMATH DE number 2155198 (Why is no real title available?)
| 2005-04-11 | Paper |
Undecidability in matrices over Laurent polynomials.
Advances in Applied Mathematics | 2005-01-26 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
scientific article; zbMATH DE number 2087488 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087233 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2051181 (Why is no real title available?)
| 2004-03-07 | Paper |
Decidability of the binary infinite Post Correspondence Problem
Discrete Applied Mathematics | 2003-09-22 | Paper |
Mortality in Matrix Semigroups
American Mathematical Monthly | 2002-09-05 | Paper |
Binary (generalized) Post Correspondence Problem
Theoretical Computer Science | 2002-07-15 | Paper |
Marked PCP is decidable
Theoretical Computer Science | 2001-08-20 | Paper |
Some new results on Post correspondence problem and its modifications
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
Generalized Post correspondence problem for marked morphisms
International Journal of Algebra and Computation | 2001-04-17 | Paper |
scientific article; zbMATH DE number 1522564 (Why is no real title available?)
| 2001-03-13 | Paper |
scientific article; zbMATH DE number 1390073 (Why is no real title available?)
| 2000-10-03 | Paper |
Periods and binary words
Journal of Combinatorial Theory. Series A | 2000-05-11 | Paper |
scientific article; zbMATH DE number 1408339 (Why is no real title available?)
| 2000-02-29 | Paper |
scientific article; zbMATH DE number 1339970 (Why is no real title available?)
| 1999-09-22 | Paper |
Undecidability of the equivalence of finite substitutions on regular language
RAIRO - Theoretical Informatics and Applications | 1999-09-22 | Paper |
scientific article; zbMATH DE number 1304321 (Why is no real title available?)
| 1999-06-17 | Paper |
