Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Aperiodic graphComputer scienceDegree (graph theory)Directed graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Synchronizing chaotification with support vector machine and wolf pack search algorithm for estimation of peripheral vascular occlusion in diabetes mellitus
2011
2011
Urban Transit Coordination Using an Artificial Transportation System
An urban transit system usually consists of several modes, including busses, streetcars, a subway, and light rail. Unfortunately… 
2007
2007
New Algorithms for Finding Short Reset Sequences in Synchronizing Automata
Finding synchronizing sequences for the finite automata is a very important problem in many practical applications (part… 
2002
2002
Design and performance of a high-quality cardiac flat detector
A dynamic flat detector with optimized overall system design has been developed by Trixell together with its partners. This… 
2000
2000
A 1 GHz portable digital delay-locked loop with infinite phase capture ranges
Delay-locked loops (DLLs) are widely used to align signal phases in many high-speed microprocessors and memories. Phase-locked… 
1998
1998
Transmission of Signals via Synchronization of Chaotic Time-Delay Systems
Secure communication via chaotic synchronization is demonstrated using dynamical systems governed by delay deferential equations… 
1996
1996
On the (non-)resetability of synchronous sequential circuits
We present a tool to compute a synchronizing sequence for synchronous sequential circuits. It consists of three parts. One part… 
Highly Cited
1993
Highly Cited
1993
Synchronizing sequences and symbolic traversal techniques in test generation
Asynchronizing sequence drives a circuit from an arbitrary power-up state into a unique state. Test generation on a circuit… 
1992
1992
Initializability Consideration in Sequential Machine Synthesis
It is shown that a finite-state machine, whose state encoding is obtained only to reduce the amount of logic in the final… 
1989
1989
STATE ASSIGNMENT FOR INITIALIZABLE SYNTHESIS
Previous work on automatic state assignment for finite state machines is primarily aimed at reducing the amount of logic in the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)