The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vesa Halava: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vesa Halava
    Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:81-88 [Conf]
  2. Vesa Halava, Tero Harju
    Infinite Solutions of Marked Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:57-68 [Conf]
  3. Vesa Halava, Tero Harju
    Languages Accepted by Integer Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:123-134 [Conf]
  4. Vesa Halava, Tero Harju
    An Undecidability Result Concerning Periodic Morphisms. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:304-310 [Conf]
  5. Vesa Halava, Tero Harju, Mika Hirvensalo
    Generalized PCP Is Decidable for Marked Morphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:304-315 [Conf]
  6. Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
    Languages Defined by Generalized Equality Sets. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:355-363 [Conf]
  7. Vesa Halava, Mika Hirvensalo, Ronald de Wolf
    Decidability and Undecidability of Marked PCP. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:207-216 [Conf]
  8. Vesa Halava, Tero Harju, Mika Hirvensalo
    Positivity of second order linear recurrent sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:3, pp:447-451 [Journal]
  9. Vesa Halava, Tero Harju, Juhani Karhumäki
    Decidability of the binary infinite Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:521-526 [Journal]
  10. Vesa Halava, Tero Harju
    Some New Results on Post Correspondence Problem and Its Modifications. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:73, n:, pp:131-141 [Journal]
  11. Vesa Halava, Tero Harju, Michel Latteux
    Representation of Regular Languages by Equality Sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:86, n:, pp:224-228 [Journal]
  12. Vesa Halava, Tero Harju
    Undecidability in Integer Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:189-200 [Journal]
  13. Vesa Halava, Tero Harju, Juhani Karhumäki
    Undecidability in omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:119-125 [Journal]
  14. Vesa Halava, Tero Harju, Mika Hirvensalo
    Generalized Post Correspondence Problem for Marked Morphisms. [Citation Graph (0, 0)][DBLP]
    IJAC, 2000, v:10, n:6, pp:757-772 [Journal]
  15. Vesa Halava, Tero Harju, Lucian Ilie
    On a Geometric Problem of Zigzags. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:1, pp:1-4 [Journal]
  16. Vesa Halava, Tero Harju, Michel Latteux
    Equality sets of prefix morphisms and regular star languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:4, pp:151-154 [Journal]
  17. Vesa Halava, Tero Harju
    Undecidability of the equivalence of finite substitutions on regular language. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:117-124 [Journal]
  18. Vesa Halava, Tero Harju, Lucian Ilie
    Periods and Binary Words. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:2, pp:298-303 [Journal]
  19. Vesa Halava, Tero Harju, Mika Hirvensalo
    Binary (generalized) Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:183-204 [Journal]
  20. Vesa Halava, Mika Hirvensalo, Ronald de Wolf
    Marked PCP is decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:193-204 [Journal]
  21. Vesa Halava, Mika Hirvensalo
    Improved matrix pair undecidability results. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:44, n:3-4, pp:191-205 [Journal]
  22. Vesa Halava, Tero Harju, Juhani Karhumäki
    The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:1, pp:43-54 [Journal]
  23. Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
    Extension of the decidability of the marked PCP to instances with unique blocks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:355-362 [Journal]

  24. On the Periodicity of Morphic Words. [Citation Graph (, )][DBLP]


  25. On the Joint Spectral Radius for Bounded Matrix Languages. [Citation Graph (, )][DBLP]


  26. Interaction Properties of Relational Periods. [Citation Graph (, )][DBLP]


  27. Preface. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002