L'ubomíra Balková

Publication Activity (10 Years)

Years Active: 2006-2016
Publications (10 Years): 1

Top Topics

Pseudorandom Number

Automated Theorem Proving

Top Venues

Theor. Comput. Sci.

Publications

L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Jirí Hladký, Svetlana Puzynina
Aperiodic pseudorandom number generators based on infinite words. Theor. Comput. Sci. 647 (2016)
L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Jirí Hladký, Svetlana Puzynina
Aperiodic pseudorandom number generators based on infinite words. CoRR (2013)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Proof of the Brlek-Reutenauer conjecture. Theor. Comput. Sci. 475 (2013)
L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Svetlana Puzynina
Infinite Words with Well Distributed Occurrences. WORDS (2013)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Corrigendum: "On Brlek-Reutenauer conjecture". Theor. Comput. Sci. 465 (2012)
L'ubomíra Balková
Factor Frequencies in Languages Invariant Under Symmetries Preserving Factor Frequencies. Integers 12 (2012)
L'ubomíra Balková
Factor frequencies in generalized Thue-Morse words. Kybernetika 48 (3) (2012)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Proof of Brlek-Reutenauer conjecture CoRR (2012)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Infinite words with finite defect. Adv. Appl. Math. 47 (3) (2011)
L'ubomíra Balková, Karel Brinda, Ondrej Turek
Abelian complexity of infinite words associated with quadratic Parry numbers. Theor. Comput. Sci. 412 (45) (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
On Brlek-Reutenauer conjecture. Theor. Comput. Sci. 412 (41) (2011)
L'ubomíra Balková, Karel Klouda, Edita Pelantová
Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers. Integers (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Informatics Appl. 44 (4) (2010)
L'ubomíra Balková, Edita Pelantová
A note on symmetries in the Rauzy graph and factor frequencies. Theor. Comput. Sci. 410 (27-29) (2009)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Palindromes in infinite ternary words. RAIRO Theor. Informatics Appl. 43 (4) (2009)
L'ubomíra Balková, Zuzana Masáková
Palindromic complexity of infinite words associated with non-simple Parry numbers. RAIRO Theor. Informatics Appl. 43 (1) (2009)
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) (2007)
L'ubomíra Balková, Edita Pelantová, Wolfgang Steiner
Sequences with constant number of return words CoRR (2006)
L'ubomíra Balková, Edita Pelantová, Ondrej Turek
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers CoRR (2006)