default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArto Lepistö
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[e4]Juhani Karhumäki, Arto Lepistö, Luca Q. Zamboni:
Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings. Lecture Notes in Computer Science 8079, Springer 2013, ISBN 978-3-642-40578-5 [contents]- 2012
- [e3]Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii:
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7353, Springer 2012, ISBN 978-3-642-30641-9 [contents]
2000 – 2009
- 2007
- [j3]Arto Lepistö, Francesco Pappalardi
, Kalle Saari:
Transposition invariant words. Theor. Comput. Sci. 380(3): 377-387 (2007) - [e2]Tero Harju, Juhani Karhumäki, Arto Lepistö:
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings. Lecture Notes in Computer Science 4588, Springer 2007, ISBN 978-3-540-73207-5 [contents] - 2005
- [j2]Tero Harju, Arto Lepistö, Dirk Nowotka:
A characterization of periodicity of bi-infinite words. Theor. Comput. Sci. 347(1-2): 419-422 (2005) - 2004
- [e1]Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella:
Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Lecture Notes in Computer Science 3142, Springer 2004, ISBN 3-540-22849-7 [contents] - 2002
- [j1]Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski:
Locally Periodic Versus Globally Periodic Infinite Words. J. Comb. Theory A 100(2): 250-264 (2002)
1990 – 1999
- 1999
- [c6]Arto Lepistö:
Relations between Local and Global Periodicity of Words. ICALP 1999: 534-543 - 1998
- [c5]Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski:
Locally Periodic Infinite Words and a Chaotic Behaviour. ICALP 1998: 421-430 - 1995
- [c4]Arto Lepistö:
On the Computational Complexity of Infinite Words. Developments in Language Theory 1995: 350-359 - 1994
- [c3]Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö:
Comparing Descriptional and Computational Complexity of Infinite Words. Results and Trends in Theoretical Computer Science 1994: 169-182 - 1993
- [c2]Arto Lepistö:
Repetitions in Kolakoski Sequence. Developments in Language Theory 1993: 130-143 - [c1]Arto Lepistö:
On the Power of Periodic Iteration of Morphisms. ICALP 1993: 496-506
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
