Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 3548 results
Sort by: relevance publication year

Factor versus palindromic complexity of uniformly recurrent infinite words

JOURNAL ARTICLE published June 2007 in Theoretical Computer Science

Research funded by Ministerstvo Školství, Mládeže a Tělovýchovy (LC00602) | Grantová Agentura České Republiky (GACˇ R 201/05/0169)

Authors: Peter Baláži | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1016/j.tcs.2007.03.019 Actions

On a class of infinite words with affine factor complexity

JOURNAL ARTICLE published December 2007 in Theoretical Computer Science

Research funded by Grantová Agentura České Republiky (GA Cˇ R 201/05/0169,LC06002)

Authors: Julien Bernat | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1016/j.tcs.2007.07.001 Actions

Palindromic complexity of infinite words associated with simple Parry numbers

JOURNAL ARTICLE published 2006 in Annales de l’institut Fourier

Authors: Petr Ambrož | Zuzana Masáková | Edita Pelantová | Christiane Frougny

https://doi.org/10.5802/aif.2236 Actions

Infinite special branches in words associated with beta-expansions

JOURNAL ARTICLE published 1 January 2007 in Discrete Mathematics & Theoretical Computer Science

Authors: Christiane Frougny | Zuzana Masáková | Edita Pelantová

https://doi.org/10.46298/dmtcs.415 Actions

Complexity of infinite words associated with beta-expansions

JOURNAL ARTICLE published April 2004 in RAIRO - Theoretical Informatics and Applications

Authors: Christiane Frougny | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1051/ita:2004009 Actions

Corrigendum: Complexity of infinite words associated with beta-expansions

JOURNAL ARTICLE published July 2004 in RAIRO - Theoretical Informatics and Applications

Authors: Christiane Frougny | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1051/ita:2004014 Actions

Palindromic complexity of infinite words associated with non-simple Parry numbers

JOURNAL ARTICLE published January 2009 in RAIRO - Theoretical Informatics and Applications

Authors: L'ubomíra Balková | Zuzana Masáková

https://doi.org/10.1051/ita:2008005 Actions

Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers

JOURNAL ARTICLE published August 2009 in INTEG

Authors: Karel Klouda | Edita Pelantová

https://doi.org/10.1515/integ.2009.025 Actions

Combinatorial properties of infinite words associated with cut-and-project sequences

JOURNAL ARTICLE published 2003 in Journal de Théorie des Nombres de Bordeaux

Authors: Louis-Sébastien Guimond | Zuzana Masáková | Edita Pelantová

https://doi.org/10.5802/jtnb.422 Actions

ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS

JOURNAL ARTICLE published April 2004 in International Journal of Foundations of Computer Science

Authors: S. BRLEK | S. HAMEL | M. NIVAT | C. REUTENAUER

https://doi.org/10.1142/s012905410400242x Actions

Morphisms generating antipalindromic words

JOURNAL ARTICLE published October 2020 in European Journal of Combinatorics

Authors: Petr Ambrož | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1016/j.ejc.2020.103160 Actions

Palindromic length of words and morphisms in class P

JOURNAL ARTICLE published August 2019 in Theoretical Computer Science

Research funded by European Regional Development Fund (CZ.02.1.01/0.0/0.0/16_019/0000778) | Czech Technical University in Prague (SGS17/193/OHK4/3T/14)

Authors: Petr Ambrož | Ondřej Kadlec | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1016/j.tcs.2019.02.024 Actions

Enumerating Abelian Returns to Prefixes of Sturmian Words

BOOK CHAPTER published 2013 in Lecture Notes in Computer Science

Authors: Zuzana Masáková | Edita Pelantová

https://doi.org/10.1007/978-3-642-40579-2_21 Actions

Self-Matching Properties of Beatty Sequences

JOURNAL ARTICLE published 2 January 2007 in Acta Polytechnica

Authors: Z. Masáková | E. Pelantová

https://doi.org/10.14311/924 Actions

Complexity and palindromic defect of infinite words

JOURNAL ARTICLE published February 2011 in Theoretical Computer Science

Authors: S. Brlek | C. Reutenauer

https://doi.org/10.1016/j.tcs.2010.11.025 Actions

Relation between powers of factors and the recurrence function characterizing Sturmian words

JOURNAL ARTICLE published September 2009 in Theoretical Computer Science

Authors: Z. Masáková | E. Pelantová

https://doi.org/10.1016/j.tcs.2009.04.003 Actions

On Words with the Zero Palindromic Defect

BOOK CHAPTER published 2017 in Lecture Notes in Computer Science

Authors: Edita Pelantová | Štěpán Starosta

https://doi.org/10.1007/978-3-319-66396-8_7 Actions

Morphisms fixing words associated with exchange of three intervals

JOURNAL ARTICLE published January 2010 in RAIRO - Theoretical Informatics and Applications

Authors: Petr Ambrož | Zuzana Masáková | Edita Pelantová

https://doi.org/10.1051/ita/2010002 Actions

Ambiguity in the m-bonacci numeration system

JOURNAL ARTICLE published 1 January 2007 in Discrete Mathematics & Theoretical Computer Science

Authors: Petra Kocábová | Zuzana Masáková | Edita Pelantová

https://doi.org/10.46298/dmtcs.381 Actions

Uniformly balanced words with linear complexity and prescribed letter frequencies

JOURNAL ARTICLE published 17 August 2011 in Electronic Proceedings in Theoretical Computer Science

Authors: Valérie Berthé | Sébastien Labbé

https://doi.org/10.4204/eptcs.63.8 Actions
Feedback: support@crossref.org