Skip to main content
SpringerLink
Log in

Some Aspects of Synchronization of DFA

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automata (DFA) if w brings all states of the automaton to a unique state. According to the famous conjecture of Černý from 1964, every n-state synchronizing automaton possesses a synchronizing word of length at most (n–1)2. The problem is still open. It will be proved that the Černý conjecture holds good for synchronizing DFA with transition monoid having no involutions and for every n-state (n > 2) synchronizing DFA with transition monoid having only trivial subgroups the minimal length of synchronizing word is not greater than (n–1)2/2. The last important class of DFA involved and studied by Schŭtzenberger is called aperiodic; its automata accept precisely star-free languages. Some properties of an arbitrary synchronizing DFA were established. See http://www.cs.biu.ac.il/~trakht/syn.html.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Černý J. A remark on homogeneous experiments with finite automata. Mat.-Fyz. Časopis Sloven. Akad. Vied, 1964, 14: 208–215. (in Slovak)

    MATH  Google Scholar 

  2. Frankl P. An extremal problem for two families of sets. European J. Combin., 1982, 3(2): 125–127.

    MATH  MathSciNet  Google Scholar 

  3. Kljachko A A, Rystsov I C, Spivak M A. On an extremal combinatorial problem connected with an estimate for the length of a reflexive word in an automation. Kibernetika (Kiev), 1987, 132(2): 16–25. (in Russian)

    Google Scholar 

  4. Pin J E. On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics, Marseille-Luminy, 1981, pp.535–548, North-Holland Math. Stud., 75 Amsterdam: North-Holland, 1983.

  5. Kari J. Synchronizing finite automata on Eulerian digraphs. Lect. Notes in Comp. Sci., Vol. 2136, Springer, 2001, pp.432–438.

  6. Salomaa A. Generation of constants and synchronization of finite automata. J. Univers. Comput. Sci., 2002, 8(2): 332–347.

    MathSciNet  Google Scholar 

  7. Trahtman A N. Notable trends concerning the synchronization of graphs and automata. In Proc. Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW2006), Lambrecht, Germany, pp.173–175, Electron. Notes Discrete Math., 25, Amsterdam: Elsvier, 2006.

  8. Dubuc L. Sur le automates circulaires et la conjecture de Černý. RAIRO Inform. Theor. Appl., 1998, 32(1–3): 21–34.

    MathSciNet  Google Scholar 

  9. Rystsov I K. Almost optimal bound on recurrent word length for regular automata. Cybernetics and System An., 1995, 31(5): 669–674.

    Article  MATH  MathSciNet  Google Scholar 

  10. Schǔtzenberger M P. On finite monoids having only trivial subgroups. Information and Control, 1965, 8(2): 190–194.

    Article  MathSciNet  Google Scholar 

  11. Rystsov I K. Reset words for commutative and solvable automata. Theoretical Computer Science, 1997, 172(1/2): 273–279.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bar-Ilan University, Department of Mathematics, 52900, Ramat Gan, Israel

    Avraham Trahtman

Authors
  1. Avraham Trahtman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Avraham Trahtman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trahtman, A. Some Aspects of Synchronization of DFA. J. Comput. Sci. Technol. 23, 719–727 (2008). https://doi.org/10.1007/s11390-008-9165-4

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9165-4

Keywords

Search

Navigation