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”

Synchronizing delay for binary uniform morphisms

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F16%3A00236171" target="_blank" >RIV/68407700:21340/16:00236171 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21240/16:00236171

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0304397515011299" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0304397515011299</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Synchronizing delay for binary uniform morphisms

  • Original language description

    Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a general upper bound on the minimal value of a synchronizing delay of a circular D0L-system with a binary uniform morphism is given.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP13-35273P" target="_blank" >GP13-35273P: Algorithms for circular morphisms and their fixed points</a><br>

  • Continuities

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

Others

  • Publication year

    2016

  • 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

    615

  • Issue of the periodical within the volume

    February

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    11

  • Pages from-to

    12-22

  • UT code for WoS article

    000368965500002

  • EID of the result in the Scopus database

    2-s2.0-84953361697