Synchronizing Words for Timed and Weighted Automata

@inproceedings{Doyen2013SynchronizingWF,
  title={Synchronizing Words for Timed and Weighted Automata},
  author={Laurent Doyen and Line Juhl and Kim G. Larsen and Nicolas Markey and Mahsa Shirmohammadi},
  year={2013}
}
The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for deterministic complete finite automata, with polynomial bounds on the length of the shortest synchronizing word and the existence problem being NLOGSPACE-complete. In this paper we consider synchronizing-word problems for timed and weighted automata. We consider the synchronization problem in several… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Poznámka k homogénnym experimentom s konečnými automatmi

J. Černý
Matematicko-fyzikálny časopis, 14(3):208–216 • 1964
View 3 Excerpts
Highly Influenced

In LATA’08

M. V. Volkov. Synchronizing automata, the Černý conjecture
LNCS 5196, p. 11–27. Springer, • 2008

DNA molecule provides a computing machine with both data and fuel.

Proceedings of the National Academy of Sciences of the United States of America • 2003

A Theory of Timed Automata

Theor. Comput. Sci. • 1994
View 2 Excerpts

Computation: Finite and Infinite Machines

M. L. Minsky
Prentice Hall, Inc. • 1967
View 1 Excerpt

Similar Papers

Loading similar papers…