Search results for "Vesa Halava"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Vesa Halava, Stepan Holub	Reduction Tree of the Binary Generalized Post Correspondence Problem.	Int. J. Found. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki	A new proof for the decidability of D0L ultimate periodicity	WORDS	2011	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki	On the number of squares in partial words.	RAIRO - Theor. Inf. and Applic.	2010	DBLP DOI BibTeX RDF
1	Paul Bell, Vesa Halava, Mika Hirvensalo	On the Joint Spectral Radius for Bounded Matrix Languages.	RP	2010	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo	On the Periodicity of Morphic Words.	Developments in Language Theory	2010	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold	Overlap-freeness in infinite partial words.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Vesa Halava, Jarkko Kari, Yuri Matiyasevich	On post correspondence problem for letter monotonic languages.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki	The theorem of Fine and Wilf for relational periods.	ITA	2009	DBLP DOI BibTeX RDF
1	Vesa Halava, Igor Potapov	Preface.	Int. J. Found. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki	Square-free partial words.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki	Post Correspondence Problem for short words.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
1	Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov	Matrix Equations and Hilbert's Tenth Problem.	IJAC	2008	DBLP DOI BibTeX RDF
1	Vesa Halava, Igor Potapov	Preface.	Int. J. Found. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Tomi Kärki, Tero Harju, Vesa Halava	Interaction Properties of Relational Periods.	Discrete Mathematics & Theoretical Computer Science	2008	DBLP BibTeX RDF
1	Vesa Halava, Igor Potapov	Preface.	Electr. Notes Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Tomi Kärki	Relational codes of words.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux	Extension of the decidability of the marked PCP to instances with unique blocks.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo	Undecidability Bounds for Integer Matrices Using Claus Instances.	Int. J. Found. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Vesa Halava, Mika Hirvensalo	Improved matrix pair undecidability results.	Acta Inf.	2007	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Juhani Karhumäki	The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju	Undecidability of infinite post correspondence problem for instances of Size 9.	ITA	2006	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Juhani Karhumäki	Undecidability in omega-Regular Languages.	Fundam. Inform.	2006	DBLP BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo	Positivity of second order linear recurrent sequences.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Michel Latteux	Equality sets of prefix morphisms and regular star languages.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux	Equality sets for recursively enumerable languages.	ITA	2005	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Michel Latteux	Representation of Regular Languages by Equality Sets.	Bulletin of the EATCS	2005	DBLP BibTeX RDF
1	Vesa Halava	Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials.	Theory Is Forever	2004	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Juhani Karhumäki	Decidability of the binary infinite Post Correspondence Problem.	Discrete Applied Mathematics	2003	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux	Languages Defined by Generalized Equality Sets.	FCT	2003	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo	Binary (generalized) Post Correspondence Problem.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju	Infinite Solutions of Marked Post Correspondence Problem.	Formal and Natural Computing	2002	DBLP DOI BibTeX RDF
1	Vesa Halava, Mika Hirvensalo, Ronald de Wolf	Marked PCP is decidable.	Theor. Comput. Sci.	2001	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju	Some New Results on Post Correspondence Problem and Its Modifications.	Bulletin of the EATCS	2001	DBLP BibTeX RDF
1	Vesa Halava, Tero Harju	An Undecidability Result Concerning Periodic Morphisms.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Lucian Ilie	Periods and Binary Words.	J. Comb. Theory, Ser. A	2000	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo	Generalized Post Correspondence Problem for Marked Morphisms.	IJAC	2000	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju	Undecidability of the equivalence of finite substitutions on regular language.	ITA	1999	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju	Undecidability in Integer Weighted Finite Automata.	Fundam. Inform.	1999	DBLP DOI BibTeX RDF
1	Vesa Halava, Mika Hirvensalo, Ronald de Wolf	Decidability and Undecidability of Marked PCP.	STACS	1999	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo	Generalized PCP Is Decidable for Marked Morphisms.	FCT	1999	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju	Languages Accepted by Integer Weighted Finite Automata.	Jewels are Forever	1999	DBLP BibTeX RDF
1	Vesa Halava, Tero Harju, Lucian Ilie	On a Geometric Problem of Zigzags.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF

Publications of "Vesa Halava" ( http://dblp.L3S.de/Authors/Vesa_Halava )