Synchronizing word

Known as: Černý conjecture, Černy conjecture, Synchronizing sequence 
In computer science, more precisely, in the theory of deterministic finite automata (DFA), a synchronizing word or reset sequence is a word in the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$ states always has a synchronizing word of length at… (More)
Is this relevant?
2017
2017
It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synchronizing word of length at… (More)
Is this relevant?
2017
2017
It was conjectured by Černý in 1964, that a synchronizing DFA on n states always has a synchronizing word of length at most (n−1… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We characterize what is feasible concerning clock synchronization in wireline or wireless networks. We consider a net work of n… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
Černý’s conjecture asserts the existence of a synchronizing word of length at most (n − 1) for any synchronized n-state… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A major challenge in analyzing animal behavior is to discover some underlying simplicity in complex motor actions. Here, we show… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Checkpointing algorithms are classiied as synchronous and asynchronous in the literature. In synchronous checkpointing, processes… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We discuss the problem of detecting errors in measurements of the total delay experienced by packets transmitted through a wide… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Our goal is to develop a portable user interface and continuous media support library that can be used to implement a variety of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The problem of synchronizing clocks of processes in a fully connected network is considered. It is proved that, even if the… (More)
  • figure 1
Is this relevant?