Vesa Halava

According to our database1, Vesa Halava
  • authored at least 57 papers between 1997 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Weighted automata on infinite words in the context of Attacker-Defender games.
Inf. Comput., 2017

Small Semi-Thue System Universal with Respect to the Termination Problem.
Fundam. Inform., 2017

A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem.
Fundam. Inform., 2017

2015
On the n-permutation Post Correspondence Problem.
Theor. Comput. Sci., 2015

On Robot Games of Degree Two.
Proceedings of the Language and Automata Theory and Applications, 2015

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Preface.
Fundam. Inform., 2014

On Undecidability of Counter Reachability Games in Dimension One.
CoRR, 2014

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

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

2013
Decision Problems for Probabilistic Finite Automata on Bounded Languages.
Fundam. Inform., 2013

New proof for the undecidability of the circular PCP.
Acta Inf., 2013

Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem.
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.
Fundam. Inform., 2012

2011
Reduction Tree of the Binary Generalized Post Correspondence Problem.
Int. J. Found. Comput. Sci., 2011

A new proof for the decidability of D0L ultimate periodicity
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

2010
On the number of squares in partial words.
RAIRO - Theor. Inf. and Applic., 2010

On the Joint Spectral Radius for Bounded Matrix Languages.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

On the Periodicity of Morphic Words.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
On post correspondence problem for letter monotonic languages.
Theor. Comput. Sci., 2009

Overlap-freeness in infinite partial words.
Theor. Comput. Sci., 2009

The theorem of Fine and Wilf for relational periods.
ITA, 2009

Preface.
Int. J. Found. Comput. Sci., 2009

2008
Square-free partial words.
Inf. Process. Lett., 2008

Post Correspondence Problem for short words.
Inf. Process. Lett., 2008

Preface.
Int. J. Found. Comput. Sci., 2008

Matrix Equations and Hilbert's Tenth Problem.
IJAC, 2008

Preface.
Electr. Notes Theor. Comput. Sci., 2008

Interaction Properties of Relational Periods.
Discrete Mathematics & Theoretical Computer Science, 2008

2007
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci., 2007

Relational codes of words.
Theor. Comput. Sci., 2007

The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.
Theory Comput. Syst., 2007

Undecidability Bounds for Integer Matrices Using Claus Instances.
Int. J. Found. Comput. Sci., 2007

Improved matrix pair undecidability results.
Acta Inf., 2007

2006
Undecidability of infinite post correspondence problem for instances of Size 9.
ITA, 2006

Undecidability in omega-Regular Languages.
Fundam. Inform., 2006

Positivity of second order linear recurrent sequences.
Discrete Applied Mathematics, 2006

2005
Equality sets for recursively enumerable languages.
ITA, 2005

Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett., 2005

Representation of Regular Languages by Equality Sets.
Bulletin of the EATCS, 2005

2004
Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials.
Proceedings of the Theory Is Forever, 2004

2003
Decidability of the binary infinite Post Correspondence Problem.
Discrete Applied Mathematics, 2003

Languages Defined by Generalized Equality Sets.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Binary (generalized) Post Correspondence Problem.
Theor. Comput. Sci., 2002

Infinite Solutions of Marked Post Correspondence Problem.
Proceedings of the Formal and Natural Computing, 2002

2001
Marked PCP is decidable.
Theor. Comput. Sci., 2001

Mortality in Matrix Semigroups.
The American Mathematical Monthly, 2001

Some New Results on Post Correspondence Problem and Its Modifications.
Bulletin of the EATCS, 2001

An Undecidability Result Concerning Periodic Morphisms.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Periods and Binary Words.
J. Comb. Theory, Ser. A, 2000

Generalized Post Correspondence Problem for Marked Morphisms.
IJAC, 2000

1999
Undecidability of the equivalence of finite substitutions on regular language.
ITA, 1999

Undecidability in Integer Weighted Finite Automata.
Fundam. Inform., 1999

Decidability and Undecidability of Marked PCP.
Proceedings of the STACS 99, 1999

Generalized PCP Is Decidable for Marked Morphisms.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Languages Accepted by Integer Weighted Finite Automata.
Proceedings of the Jewels are Forever, 1999

1997
On a Geometric Problem of Zigzags.
Inf. Process. Lett., 1997


  Loading...