All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Prefix frequency of lost positions

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10369435" target="_blank" >RIV/00216208:11320/17:10369435 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.tcs.2017.01.026" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2017.01.026</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.tcs.2017.01.026" target="_blank" >10.1016/j.tcs.2017.01.026</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Prefix frequency of lost positions

  • Original language description

    The concept of &quot;lost positions&quot; is a recently introduced tool for counting the number of runs in words. We investigate the frequency of lost positions in prefixes of words. This leads to an algorithm that allows to show, using an extensive computer search, that the asymptotic density of runs in binary words is less than 183/193 approximate to 0.9482.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/GA13-01832S" target="_blank" >GA13-01832S: General algebra and its connections to computer science</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Theoretical Computer Science

  • ISSN

    0304-3975

  • e-ISSN

  • Volume of the periodical

    2017

  • Issue of the periodical within the volume

    684

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    10

  • Pages from-to

    43-52

  • UT code for WoS article

    000404698500004

  • EID of the result in the Scopus database