Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Petr Ambrož"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 3, Iss Graph Theory (2011)
Graph Theory
Externí odkaz:
https://doaj.org/article/9634ebf58ce44de798de67dae2e732da
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 2 (2007)
We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x 3 - mx 2 - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in b
Externí odkaz:
https://doaj.org/article/e4f6b2a8145f41b8be4bf47a396a7c84
Publikováno v:
Theoretical Computer Science. 780:74-83
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class P introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word and the T
Autor:
Jiri Vevoda, Daniela Navratilova, Ondrej Machaczka, Petr Ambroz, Sarka Vevodova, Marco Tomietto
Publikováno v:
BMC Nursing, Vol 22, Iss 1, Pp 1-12 (2023)
Abstract Background The perception of the quality of care provided by the medical institution to patients is directly affected by the job satisfaction of nurses. The feeling of job satisfaction is caused besides other things by the subjective expecta
Externí odkaz:
https://doaj.org/article/8acb710ac0a948e190eb65d38c01cf92
Autor:
Edita Pelantová, Petr Ambrož
Publikováno v:
Developments in Language Theory ISBN: 9783030248857
DLT
DLT
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word w as the minimal number of palindromes whose concatenation is equal to w. For an infinite word \(\varvec{u}\) we study \(\mathrm {pal}_{\varvec{u}}\), that is, the func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f80de21c1cedf5fc828dcaff44ac5470
https://doi.org/10.1007/978-3-030-24886-4_18
https://doi.org/10.1007/978-3-030-24886-4_18
Publikováno v:
European Journal of Combinatorics. 89:103160
We introduce two classes of morphisms over the alphabet A = { 0 , 1 } whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism E : { 0 , 1 } ∗ → { 0 , 1
Publikováno v:
Journal of Physics: Conference Series. 1194:012005
Publikováno v:
Physics Procedia. 12:638-645
Contribution deals with numerical simulation of thermal and stress fields in welding tubes made of austenitic stainless CrNi steel type AISI 304 with a pulsed Nd:YAG laser. Process simulation was realised by use of ANSYS 10 software. Experiments were
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 44:3-17
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3ie
Publikováno v:
Annales de l'Institut Fourier
Annales de l'Institut Fourier, Association des Annales de l'Institut Fourier, 2006, 56, pp.2131-2160
Annales de l'Institut Fourier, Association des Annales de l'Institut Fourier, 2006, 56, pp.2131-2160
A simple Parry number is a real number \beta>1 such that the R\'enyi expansion of 1 is finite, of the form d_\beta(1)=t_1...t_m. We study the palindromic structure of infinite aperiodic words u_\beta that are the fixed point of a substitution associa