default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZuzana Masáková
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Zuzana Masáková, Edita Pelantová, Katarína Studenicová:
Rewriting Rules for Arithmetics in Alternate Base Systems. DLT 2023: 195-207- 2022
- [i6]Émilie Charlier, Célia Cisternino, Zuzana Masáková, Edita Pelantová:
Spectrum, algebraicity and normalization in alternate bases. CoRR abs/2202.03718 (2022) - 2020
- [j24]Petr Ambroz
, Zuzana Masáková, Edita Pelantová:
Morphisms generating antipalindromic words. Eur. J. Comb. 89: 103160 (2020)
2010 – 2019
- 2019
- [j23]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) - 2017
- [j22]Zuzana Masáková, Edita Pelantová, Stepán Starosta:
Exchange of three intervals: Substitutions and palindromicity. Eur. J. Comb. 62: 217-231 (2017) - 2015
- [c2]Zuzana Masáková, Edita Pelantová, Stepán Starosta:
Interval Exchange Words and the Question of Hof, Knill, and Simon. DLT 2015: 377-388 - 2014
- [j21]Zuzana Masáková, Tomás Vávra:
Integers in number systems with positive and negative quadratic Pisot base. RAIRO Theor. Informatics Appl. 48(3): 341-367 (2014) - [i5]Daniel Dombek, Zuzana Masáková, Tomás Vávra:
Confluent Parry numbers, their spectra, and integers in positive- and negative-base number systems. CoRR abs/1402.4314 (2014) - 2013
- [j20]Tomás Hejda, Zuzana Masáková, Edita Pelantová:
Greedy and lazy representations in negative base systems. Kybernetika 49(2): 258-279 (2013) - [c1]Zuzana Masáková, Edita Pelantová:
Enumerating Abelian Returns to Prefixes of Sturmian Words. WORDS 2013: 193-204 - [i4]Zuzana Masáková, Edita Pelantová:
Enumerating Abelian Returns to Prefixes of Sturmian Words. CoRR abs/1303.0969 (2013) - 2012
- [j19]Zuzana Masáková, Stepan Holub:
Preface. Int. J. Found. Comput. Sci. 23(8): 1579-1582 (2012) - [j18]Karel Klouda, Zuzana Masáková, Radko Mesiar, Martin Stepnicka:
Special issue: AAMP VIII and ISCAMI 2011. Kybernetika 48(3): 357-360 (2012) - 2011
- [j17]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) - [j16]Zuzana Masáková, Tomás Vávra:
Arithmetics in numeration systems with negative quadratic base. Kybernetika 47(1): 74-92 (2011) - [j15]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) - [j14]Daniel Lenz, Zuzana Masáková, Edita Pelantová:
Note on powers in three interval exchange transformations. Theor. Comput. Sci. 412(29): 3788-3794 (2011) - [j13]Daniel Dombek, Zuzana Masáková, Edita Pelantová:
Number representation using generalized (-beta)-transformation. Theor. Comput. Sci. 412(48): 6653-6665 (2011) - [e1]Petr Ambroz, Stepan Holub, Zuzana Masáková:
Proceedings 8th International Conference Words 2011, Prague, Czech Republic, 12-16th September 2011. EPTCS 63, 2011 [contents] - [i3]Daniel Dombek, Zuzana Masáková, Edita Pelantová:
Number representation using generalized $(-\beta)$-transformation. CoRR abs/1102.3079 (2011) - 2010
- [j12]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) - [i2]Zuzana Masáková, Tomás Vávra:
Arithmetics in numeration systems with negative quadratic base. CoRR abs/1011.1403 (2010)
2000 – 2009
- 2009
- [j11]L'ubomíra Balková, Zuzana Masáková:
Palindromic complexity of infinite words associated with non-simple Parry numbers. RAIRO Theor. Informatics Appl. 43(1): 145-163 (2009) - [j10]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) - [i1]Mark Grundland, Jirí Patera, Zuzana Masáková, Neil A. Dodgson:
Image Sampling with Quasicrystals. CoRR abs/0907.3604 (2009) - 2008
- [j9]Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Matrices of 3-iet preserving morphisms. Theor. Comput. Sci. 400(1-3): 113-136 (2008) - 2007
- [j8]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) - [j7]Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Infinite Special Branches in Words Associated with Beta-Expansions. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j6]Petra Kocábová, Zuzana Masáková, Edita Pelantová:
Ambiguity in the m-Bonacci Numeration System. Discret. Math. Theor. Comput. Sci. 9(2) (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) - 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-04-24 22:59 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:
