default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Rukavicka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Josef Rukavicka
:
Upper bound for the number of privileged words. Discret. Math. 346(1): 113164 (2023)- [c5]Josef Rukavicka:
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter. DCFS 2023: 158-168 - [i12]Josef Rukavicka:
Note on dissecting power of regular languages. CoRR abs/2310.14114 (2023) - [i11]Josef Rukavicka:
Restivo Salemi property for α-power free languages with α≥5 and k≥3 letters. CoRR abs/2312.10061 (2023) - 2022
- [j7]Josef Rukavicka:
Palindromic factorization of rich words. Discret. Appl. Math. 316: 95-102 (2022) - [j6]Josef Rukavicka:
Palindromic length and reduction of powers. Theor. Comput. Sci. 930: 106-115 (2022) - [i10]Josef Rukavicka:
Restivo Salemi property for α-power free languages with #945;≥4 and k≥3 letters. CoRR abs/2202.12038 (2022) - [i9]Josef Rukavicka:
Upper bound for the number of privileged words. CoRR abs/2205.12909 (2022) - [i8]Josef Rukavicka:
Property of upper bounds on the number of rich words. CoRR abs/2212.09066 (2022) - 2021
- [j5]Josef Rukavicka:
Upper bound for palindromic and factor complexity of rich words. RAIRO Theor. Informatics Appl. 55: 1-15 (2021) - [j4]Josef Rukavicka:
A unique extension of rich words. Theor. Comput. Sci. 896: 53-64 (2021) - [i7]Josef Rukavicka:
Palindromic Length and Reduction of Powers. CoRR abs/2103.14609 (2021) - [i6]Josef Rukavicka:
Palindromic factorization of rich words. CoRR abs/2110.13078 (2021) - 2020
- [j3]Josef Rukavicka:
Upper bound for the number of closed and privileged words. Inf. Process. Lett. 156: 105917 (2020) - [c4]Josef Rukavicka:
Palindromic Length of Words with Many Periodic Palindromes. DCFS 2020: 167-179 - [c3]Josef Rukavicka:
Transition Property for α-Power Free Languages with $\alpha \ge 2$ and $k\ge 3$ Letters. DLT 2020: 294-303 - [i5]Josef Rukavicka:
Transition Property for α-Power Free Languages with α≥2 and k≥3 Letters. CoRR abs/2001.02184 (2020) - [i4]Josef Rukavicka:
Palindromic Length of Words with Many Periodic Palindromes. CoRR abs/2005.01371 (2020) - [i3]Josef Rukavicka:
Dissecting Power of a Finite Intersection of Deterministic Context Free Languages. CoRR abs/2006.15160 (2020)
2010 – 2019
- 2019
- [c2]Josef Rukavicka:
Rich Words Containing Two Given Factors. WORDS 2019: 286-298 - [i2]Josef Rukavicka:
A Unique Extension of Rich Words. CoRR abs/1910.00826 (2019) - [i1]Josef Rukavicka:
Upper bound for the number of closed and privileged words. CoRR abs/1911.11197 (2019) - 2017
- [c1]Josef Rukavicka:
On the Number of Rich Words. DLT 2017: 345-352 - 2014
- [j2]Josef Rukavicka:
Rejection of Laplace's Demon. Am. Math. Mon. 121(6): 498 (2014) - 2011
- [j1]Josef Rukavicka:
On Generalized Dyck Paths. Electron. J. Comb. 18(1) (2011)
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-04-25 05:44 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:
