Facet browsing currently unavailable
Page 1 of 681301 results
Sort by: relevance publication year
On theta-palindromic richness JOURNAL ARTICLE published March 2011 in Theoretical Computer Science Research funded by Ministerstvo Školství, Mládeže a Tělovýchovy (SGS10/085OHK4/1T/14) | Grantová Agentura České Republiky (201/09/0584,LC06002,MSM6840770039) |
Palindromic richness for languages invariant under more symmetries JOURNAL ARTICLE published January 2014 in Theoretical Computer Science Research funded by Czech Science Foundation (GAČR 201/09/0584) | Grant Agency of the Czech Technical University in Prague (SGS11/162/OHK4/3T/14) | Czech Science Foundation (GAČR 13-03538S) | Czech Science Foundation (GAČR 13-35273P) |
Languages invariant under more symmetries: Overlapping factors versus palindromic richness JOURNAL ARTICLE published November 2013 in Discrete Mathematics Research funded by Czech Science Foundation (GAČR 201/09/0584) | Grant Agency of the Czech Technical University (SGS11/162/OHK4/3T/14) | Czech Science Foundation (GAČR 13-03538S) | Czech Science Foundation (GAČR 13-35273P) |
Erratum to “The computational power of Benenson automata” [Theoret. Comput. Sci. 344 (2005) 279–297] JOURNAL ARTICLE published October 2011 in Theoretical Computer Science |
Erratum to “Acyclic automata and small expressions using multi-tilde-bar operators” [Theoret. Comput. Sci. 411 (38–39) (2010) 3423–3435] JOURNAL ARTICLE published July 2011 in Theoretical Computer Science |
On Brlek–Reutenauer conjecture JOURNAL ARTICLE published September 2011 in Theoretical Computer Science Research funded by Grantová Agentura České Republiky (201/09/0584,LC06002,MSM6840770039) | České Vysoké Učení Technické v Praze (SGS11/162/OHK4/3T/14) |
Palindromic closures using multiple antimorphisms JOURNAL ARTICLE published May 2014 in Theoretical Computer Science Research funded by Project VEGA (1/0577/14) | Czech Science Foundation (GAČR 13-03538S) | Czech Science Foundation (GAČR 13-35273P) |
Corrigendum to “A simple and efficient Union–Find–Delete algorithm” [Theoret. Comput. Sci. 412 (4–5) 487–492] JOURNAL ARTICLE published March 2012 in Theoretical Computer Science |
Complexity and palindromic defect of infinite words JOURNAL ARTICLE published February 2011 in Theoretical Computer Science |
Morphic images of episturmian words having finite palindromic defect JOURNAL ARTICLE published January 2016 in European Journal of Combinatorics Research funded by Czech Science Foundation (GAČR 13-35273P) |
Palindromic complexity of codings of rotations JOURNAL ARTICLE published October 2011 in Theoretical Computer Science |
Erratum to: Bayesian Copulae Distributions, with Application to Operational Risk Management JOURNAL ARTICLE published December 2012 in Methodology and Computing in Applied Probability |
On Morphisms Preserving Palindromic Richness JOURNAL ARTICLE published 18 March 2022 in Fundamenta Informaticae |
On Words with the Zero Palindromic Defect BOOK CHAPTER published 2017 in Lecture Notes in Computer Science |
Association of exonic variants of Klotho with metabolic syndrome in Asian Indians JOURNAL ARTICLE published May 2011 in Clinica Chimica Acta |
Tree species richness promotes productivity in temperate forests through strong complementarity between species JOURNAL ARTICLE published December 2011 in Ecology Letters |
Legendre’s and Kummer’s theorems again JOURNAL ARTICLE published December 2010 in Resonance |
Retraction notice to “Ab initio study of AlBu3 self-association” [Comput. Theoret. Chem. 1111 (2017) 27–32] JOURNAL ARTICLE published April 2018 in Computational and Theoretical Chemistry |
O. Kavitation BOOK CHAPTER published 31 December 1961 in Korrosion und Korrosionsschutz |
Erratum to: “Communication Complexity and Intrinsic Universality in Cellular Automata” [Theor. Comput. Sci. 412 (1–2) (2011) 2–21] JOURNAL ARTICLE published December 2011 in Theoretical Computer Science |