default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdita Pelantová
Person information
- affiliation: Czech Technical University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]L'ubomíra Dvoráková, Edita Pelantová:
The repetition threshold of episturmian sequences. Eur. J. Comb. 120: 104001 (2024)- [j52]L'ubomíra Dvoráková
, Edita Pelantová:
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence. Theor. Comput. Sci. 995: 114490 (2024) - 2023
- [j51]Jana Lepsová, Edita Pelantová, Stepán Starosta:
On a faithful representation of Sturmian morphisms. Eur. J. Comb. 110: 103707 (2023) - [j50]Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
On balanced sequences and their critical exponent. Theor. Comput. Sci. 939: 18-47 (2023) - [c11]L'ubomíra Dvoráková, Martin Masek, Edita Pelantová:
On a Class of 2-Balanced Sequences. WORDS 2023: 143-154 - [c10]Zuzana Masáková, Edita Pelantová, Katarína Studenicová:
Rewriting Rules for Arithmetics in Alternate Base Systems. DLT 2023: 195-207 - [i16]Izabella Ingrid Farkas, Edita Pelantová, Milena Svobodová:
From positional representation of numbers to positional representation of vectors. CoRR abs/2303.10027 (2023) - 2022
- [j49]Francesco Dolce, Edita Pelantová:
On Morphisms Preserving Palindromic Richness. Fundam. Informaticae 185(1): 1-25 (2022) - [j48]L'ubomíra Dvoráková, Daniela Opocenská, Edita Pelantová:
Asymptotic repetitive threshold of balanced sequences. Math. Comput. 92(341): 1403-1429 (2022) - [j47]L'ubomíra Dvoráková, Edita Pelantová, Daniela Opocenská, Arseny M. Shur:
On minimal critical exponent of balanced sequences. Theor. Comput. Sci. 922: 158-169 (2022) - [i15]Émilie Charlier, Célia Cisternino, Zuzana Masáková, Edita Pelantová:
Spectrum, algebraicity and normalization in alternate bases. CoRR abs/2202.03718 (2022) - [i14]Jana Lepsová, Edita Pelantová, Stepán Starosta:
On a faithful representation of Sturmian morphisms. CoRR abs/2203.00373 (2022) - 2021
- [j46]Clément Lagisquet, Edita Pelantová, Sébastien Tavenas, Laurent Vuillon:
On the Markov numbers: Fixed numerator, denominator, and sum conjectures. Adv. Appl. Math. 130: 102227 (2021) - [j45]Edita Pelantová, Stepán Starosta:
On Sturmian substitutions closed under derivation. Theor. Comput. Sci. 867: 128-139 (2021) - [c9]Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
Computation of Critical Exponent in Balanced Sequences. WORDS 2021: 78-90 - [c8]Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
On Balanced Sequences and Their Asymptotic Critical Exponent. LATA 2021: 293-304 - [i13]Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
On balanced sequences and their critical exponent. CoRR abs/2108.07503 (2021) - 2020
- [j44]Katerina Medková, Edita Pelantová, Élise Vandomme:
On non-repetitive complexity of Arnoux-Rauzy words. Discret. Appl. Math. 285: 423-433 (2020) - [j43]L'ubomíra Dvoráková, Katerina Medková, Edita Pelantová:
Complementary symmetric Rote sequences: the critical exponent and the recurrence function. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j42]Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Morphisms generating antipalindromic words. Eur. J. Comb. 89: 103160 (2020) - [i12]Francesco Dolce, Edita Pelantová:
On morphisms preserving palindromic richness. CoRR abs/2006.12207 (2020)
2010 – 2019
- 2019
- [j41]Christiane Frougny, Marta Pavelka, Edita Pelantová, Milena Svobodová:
On-line algorithms for multiplication and division in real and complex numeration systems. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j40]Katerina Medková, Edita Pelantová, Laurent Vuillon:
Derived sequences of complementary symmetric Rote sequences. RAIRO Theor. Informatics Appl. 53(3-4): 125-151 (2019) - [j39]Petr Ambroz, Ondrej Kadlec, Zuzana Masáková, Edita Pelantová:
Palindromic length of words and morphisms in class P. Theor. Comput. Sci. 780: 74-83 (2019) - [c7]Petr Ambroz, Edita Pelantová:
On Palindromic Length of Sturmian Sequences. DLT 2019: 244-250 - 2018
- [j38]Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta:
Fixed points of Sturmian morphisms and their derivated words. Theor. Comput. Sci. 743: 23-37 (2018) - 2017
- [j37]Sébastien Labbé, Edita Pelantová, Stepán Starosta:
On the Zero Defect Conjecture. Eur. J. Comb. 62: 132-146 (2017) - [j36]Zuzana Masáková, Edita Pelantová, Stepán Starosta:
Exchange of three intervals: Substitutions and palindromicity. Eur. J. Comb. 62: 217-231 (2017) - [c6]Edita Pelantová, Stepán Starosta:
On Words with the Zero Palindromic Defect. WORDS 2017: 59-71 - 2016
- [j35]Edita Pelantová, Stepán Starosta:
Constructions of words rich in palindromes and pseudopalindromes. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j34]Sébastien Labbé, Edita Pelantová:
Palindromic sequences generated from marked morphisms. Eur. J. Comb. 51: 200-214 (2016) - [j33]Tomás Hejda, Edita Pelantová:
Spectral properties of cubic complex Pisot units. Math. Comput. 85(297): 401-421 (2016) - [c5]Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová:
On-line Multiplication and Division in Real and Complex Bases. ARITH 2016: 134-141 - [i11]Sébastien Labbé, Edita Pelantová, Stepán Starosta:
On the Zero Defect Conjecture. CoRR abs/1606.05525 (2016) - [i10]Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová:
On-line algorithms for multiplication and division in real and complex numeration systems. CoRR abs/1610.08309 (2016) - 2015
- [c4]Zuzana Masáková, Edita Pelantová, Stepán Starosta:
Interval Exchange Words and the Question of Hof, Knill, and Simon. DLT 2015: 377-388 - [i9]Christiane Frougny, Edita Pelantová:
Beta-representations of 0 and Pisot numbers. CoRR abs/1512.04234 (2015) - 2014
- [j32]Karel Brinda, Edita Pelantová, Ondrej Turek:
Balances of m-bonacci Words. Fundam. Informaticae 132(1): 33-61 (2014) - [j31]Edita Pelantová, Stepán Starosta:
Palindromic richness for languages invariant under more symmetries. Theor. Comput. Sci. 518: 42-63 (2014) - [j30]Tatiana Jajcayová, Edita Pelantová, Stepán Starosta:
Palindromic closures using multiple antimorphisms. Theor. Comput. Sci. 533: 37-45 (2014) - [j29]Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová:
k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems. Theor. Comput. Sci. 543: 52-67 (2014) - [c3]Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová:
Parallel algorithms for addition in non-standard number systems. ITA 2014: 1-7 - 2013
- [j28]Edita Pelantová, Stepán Starosta:
Languages invariant under more symmetries: Overlapping factors versus palindromic richness. Discret. Math. 313(21): 2432-2445 (2013) - [j27]Tomás Hejda, Zuzana Masáková, Edita Pelantová:
Greedy and lazy representations in negative base systems. Kybernetika 49(2): 258-279 (2013) - [j26]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Proof of the Brlek-Reutenauer conjecture. Theor. Comput. Sci. 475: 120-125 (2013) - [c2]Zuzana Masáková, Edita Pelantová:
Enumerating Abelian Returns to Prefixes of Sturmian Words. WORDS 2013: 193-204 - [i8]Karel Brinda, Edita Pelantová, Ondrej Turek:
Balances of m-bonacci words. CoRR abs/1301.3334 (2013) - [i7]Zuzana Masáková, Edita Pelantová:
Enumerating Abelian Returns to Prefixes of Sturmian Words. CoRR abs/1303.0969 (2013) - [i6]Tomás Hejda, Edita Pelantová:
Spectral Properties of Cubic Complex Pisot Units. CoRR abs/1312.0653 (2013) - 2012
- [j25]Edita Pelantová, Stepán Starosta:
Almost Rich Words as Morphic Images of Rich Words. Int. J. Found. Comput. Sci. 23(5): 1067-1084 (2012) - [j24]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Corrigendum: "On Brlek-Reutenauer conjecture". Theor. Comput. Sci. 465: 73-74 (2012) - [i5]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Proof of Brlek-Reutenauer conjecture. CoRR abs/1208.2505 (2012) - 2011
- [j23]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Infinite words with finite defect. Adv. Appl. Math. 47(3): 562-574 (2011) - [j22]Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová:
On the number of factors in codings of three interval exchange. Discret. Math. Theor. Comput. Sci. 13(3): 51-66 (2011) - [j21]L'ubomíra Balková, Karel Klouda, Edita Pelantová:
Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers. Integers 11B: A1 (2011) - [j20]Zuzana Masáková, Edita Pelantová, Tomás Vávra:
Arithmetics in number systems with a negative base. Theor. Comput. Sci. 412(8-10): 835-845 (2011) - [j19]Daniel Lenz, Zuzana Masáková, Edita Pelantová:
Note on powers in three interval exchange transformations. Theor. Comput. Sci. 412(29): 3788-3794 (2011) - [j18]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
On Brlek-Reutenauer conjecture. Theor. Comput. Sci. 412(41): 5649-5655 (2011) - [j17]Christiane Frougny, Edita Pelantová, Milena Svobodová:
Parallel addition in non-standard numeration systems. Theor. Comput. Sci. 412(41): 5714-5727 (2011) - [j16]Daniel Dombek, Zuzana Masáková, Edita Pelantová:
Number representation using generalized (-beta)-transformation. Theor. Comput. Sci. 412(48): 6653-6665 (2011) - [c1]Edita Pelantová, Stepán Starosta:
Infinite Words Rich and Almost Rich in Generalized Palindromes. Developments in Language Theory 2011: 406-416 - [i4]Daniel Dombek, Zuzana Masáková, Edita Pelantová:
Number representation using generalized $(-\beta)$-transformation. CoRR abs/1102.3079 (2011) - [i3]Christiane Frougny, Edita Pelantová, Milena Svobodová:
Parallel addition in non-standard numeration systems. CoRR abs/1102.5683 (2011) - 2010
- [j15]Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Morphisms fixing words associated with exchange of three intervals. RAIRO Theor. Informatics Appl. 44(1): 3-17 (2010) - [j14]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Informatics Appl. 44(4): 443-470 (2010)
2000 – 2009
- 2009
- [j13]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Palindromes in infinite ternary words. RAIRO Theor. Informatics Appl. 43(4): 687-702 (2009) - [j12]L'ubomíra Balková, Edita Pelantová:
A note on symmetries in the Rauzy graph and factor frequencies. Theor. Comput. Sci. 410(27-29): 2779-2783 (2009) - [j11]Zuzana Masáková, Edita Pelantová:
Relation between powers of factors and the recurrence function characterizing Sturmian words. Theor. Comput. Sci. 410(38-40): 3589-3596 (2009) - 2008
- [j10]Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Matrices of 3-iet preserving morphisms. Theor. Comput. Sci. 400(1-3): 113-136 (2008) - 2007
- [j9]Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j8]Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Infinite Special Branches in Words Associated with Beta-Expansions. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j7]Petra Kocábová, Zuzana Masáková, Edita Pelantová:
Ambiguity in the m-Bonacci Numeration System. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j6]L'ubomíra Balková, Edita Pelantová, Ondrej Turek:
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers. RAIRO Theor. Informatics Appl. 41(3): 307-328 (2007) - [j5]Peter Balázi, Zuzana Masáková, Edita Pelantová:
Factor versus palindromic complexity of uniformly recurrent infinite words. Theor. Comput. Sci. 380(3): 266-275 (2007) - [j4]Julien Bernat, Zuzana Masáková, Edita Pelantová:
On a class of infinite words with affine factor complexity. Theor. Comput. Sci. 389(1-2): 12-25 (2007) - 2006
- [i2]L'ubomíra Balková, Edita Pelantová, Ondrej Turek:
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers. CoRR abs/cs/0608065 (2006) - [i1]L'ubomíra Balková, Edita Pelantová, Wolfgang Steiner:
Sequences with constant number of return words. CoRR abs/math/0608603 (2006) - 2005
- [j3]Petra Kocábová, Zuzana Masáková, Edita Pelantová:
Integers with a maximal number of Fibonacci representations. RAIRO Theor. Informatics Appl. 39(2): 343-359 (2005) - 2004
- [j2]Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Complexity of infinite words associated with beta-expansions. RAIRO Theor. Informatics Appl. 38(2): 163-185 (2004) - [j1]Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions. RAIRO Theor. Informatics Appl. 38(3): 269-271 (2004)
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-08-03 20:17 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:
