Vesa Halava

Stepan Holub

Int. J. Found. Comput. Sci., 2024

2023

On bi-infinite and conjugate post correspondence problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

Integer Weighted Automata on Infinite Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2023

Decision Problems on Copying and Shuffling.

[BibT_eX]

[DOI]

CoRR, 2023

2022

A recursive function coding number theoretic functions.

[BibT_eX]

[DOI]

Teemu Pirttimäki

CoRR, 2022

2021

Undecidability in Finite Transducers, Defense Systems and Finite Substitutions.

[BibT_eX]

[DOI]

CoRR, 2021

The Conjugate Post Correspondence Problem.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On Shuffling a Word with its Letter-to-Letter Substitution.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem.

[BibT_eX]

[DOI]

Acta Cybern., 2020

2018

On fixed points of rational transductions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Perface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

2017

Walks on tilings of polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Weighted automata on infinite words in the context of Attacker-Defender games.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Small Semi-Thue System Universal with Respect to the Termination Problem.

[BibT_eX]

[DOI]

Yuri V. Matiyasevich

Reino Niskanen

Fundam. Informaticae, 2017

A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

2015

On the n-permutation Post Correspondence Problem.

[BibT_eX]

[DOI]

Mari Ernvall

Theor. Comput. Sci., 2015

On Robot Games of Degree Two.

[BibT_eX]

[DOI]

Reino Niskanen

Igor Potapov

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Preface.

[BibT_eX]

[DOI]

Yuri V. Matiyasevich

Fundam. Informaticae, 2014

On Undecidability of Counter Reachability Games in Dimension One.

[BibT_eX]

[DOI]

Reino Niskanen

Igor Potapov

CoRR, 2014

Another proof of undecidability for the correspondence decision problem - Had I been Emil Post.

[BibT_eX]

[DOI]

CoRR, 2014

Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Decision Problems for Probabilistic Finite Automata on Bounded Languages.

[BibT_eX]

[DOI]

Paul C. Bell

Fundam. Informaticae, 2013

New proof for the undecidability of the circular PCP.

[BibT_eX]

[DOI]

Acta Informatica, 2013

Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

2011

Reduction Tree of the Binary Generalized Post Correspondence Problem.

[BibT_eX]

[DOI]

Stepan Holub

Int. J. Found. Comput. Sci., 2011

A new proof for the decidability of D0L ultimate periodicity

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

2010

On the number of squares in partial words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

On the Joint Spectral Radius for Bounded Matrix Languages.

[BibT_eX]

[DOI]

Paul Bell

Proceedings of the Reachability Problems, 4th International Workshop, 2010

On the Periodicity of Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

On post correspondence problem for letter monotonic languages.

[BibT_eX]

[DOI]

Jarkko Kari

Yuri V. Matiyasevich

Theor. Comput. Sci., 2009

Overlap-freeness in infinite partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The theorem of Fine and Wilf for relational periods.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

2008

Square-free partial words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Post Correspondence Problem for short words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Matrix Equations and Hilbert's Tenth Problem.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2008

Preface.

[BibT_eX]

[DOI]

Igor Potapov

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Interaction Properties of Relational Periods.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

2007

Extension of the decidability of the marked PCP to instances with unique blocks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Relational codes of words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Undecidability Bounds for Integer Matrices Using Claus Instances.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Improved matrix pair undecidability results.

[BibT_eX]

[DOI]

Acta Informatica, 2007

2006

Undecidability of infinite post correspondence problem for instances of Size 9.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Undecidability in omega-Regular Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Positivity of second order linear recurrent sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Equality sets for recursively enumerable languages.

[BibT_eX]

[DOI]

Hendrik Jan Hoogeboom

RAIRO Theor. Informatics Appl., 2005

Equality sets of prefix morphisms and regular star languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Representation of Regular Languages by Equality Sets.

[BibT_eX]

Bull. EATCS, 2005

2004

Valence Languages Generated by Equality Sets.

[BibT_eX]

[DOI]

Hendrik Jan Hoogeboom

J. Autom. Lang. Comb., 2004

Undecidability in matrices over Laurent polynomials.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

Decidability of the binary infinite Post Correspondence Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Languages Defined by Generalized Equality Sets.

[BibT_eX]

[DOI]

Hendrik Jan Hoogeboom

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Binary (generalized) Post Correspondence Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Infinite Solutions of Marked Post Correspondence Problem.

[BibT_eX]

[DOI]

Proceedings of the Formal and Natural Computing, 2002

2001

Marked PCP is decidable.

[BibT_eX]

[DOI]

Ronald de Wolf

Theor. Comput. Sci., 2001

Mortality in Matrix Semigroups.

[BibT_eX]

[DOI]

Am. Math. Mon., 2001

Some New Results on Post Correspondence Problem and Its Modifications.

[BibT_eX]

Bull. EATCS, 2001

An Undecidability Result Concerning Periodic Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

Periods and Binary Words.

[BibT_eX]

[DOI]

Lucian Ilie

J. Comb. Theory, Ser. A, 2000

Generalized Post Correspondence Problem for Marked Morphisms.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2000

1999

Undecidability of the equivalence of finite substitutions on regular language.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

Undecidability in Integer Weighted Finite Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

Decidability and Undecidability of Marked PCP.

[BibT_eX]

[DOI]

Ronald de Wolf

Proceedings of the STACS 99, 1999

Generalized PCP Is Decidable for Marked Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Languages Accepted by Integer Weighted Finite Automata.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1997

On a Geometric Problem of Zigzags.

[BibT_eX]

[DOI]