Skip to main content
SpringerLink
Log in
Book cover

International Conference on Language and Automata Theory and Applications

LATA 2008: Language and Automata Theory and Applications pp 11–27Cite as

Synchronizing Automata and the Černý Conjecture

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5196))

Abstract

We survey several results and open problems related to synchronizing automata. In particular, we discuss some recent advances towards a solution of the Černý conjecture.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Almeida, J., Margolis, S., Steinberg, B., Volkov, M.V.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc (to appear, 2008), http://arxiv.org/abs/math/0702400v1

  • Ananichev, D.S.: The mortality threshold for partially monotonic automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 112–121. Springer, Heidelberg (2005)

    Google Scholar 

  • Ananichev, D.S., Volkov, M.V.: Some results on Černý type problems for transformation semigroups. In: Araujo, I., Branco, M., Fernandes, V.H., Gomes, G.M.S. (eds.) Semigroups and Languages, pp. 23–42. World Scientific, Singapore (2004)

    Chapter  Google Scholar 

  • Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theoret. Comput. Sci. 376(1-2), 30–41 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • Ashby, W.R.: An Introduction to Cybernetics. Chapman & Hall, London (1956), http://pcp.vub.ac.be/books/IntroCyb.pdf

    MATH  Google Scholar 

  • Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and autonomous computing machine made of biomolecules. Nature 414(1), 430–434 (2001)

    Article  Google Scholar 

  • Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., Shapiro, E.: DNA molecule provides a computing machine with both data and fuel. Proc. National Acad. Sci. USA 100, 2191–2196 (2003)

    Article  Google Scholar 

  • Booth, T.L.: Sequential Machines and Automata Theory. J. Wiley & Sons, New York (1967)

    MATH  Google Scholar 

  • Boppana, V., Rajan, S.P., Takayama, K., Fujita, M.: Model checking based on sequential ATPG. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 418–430. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  • Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Matematicko-fyzikalny Časopis Slovensk. Akad. Vied 14(3), 208–216 (1964) (in Slovak)

    MATH  Google Scholar 

  • Černý, J., Pirická, A., Rosenauerová, B.: On directable automata. Kybernetika 7(4), 289–298 (1971)

    MATH  MathSciNet  Google Scholar 

  • Chen, Y.-B., Ierardi, D.J.: The complexity of oblivious plans for orienting and distinguishing polygonal parts. Algorithmica 14, 367–397 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  • Cho, H., Jeong, S.-W., Somenzi, F., Pixley, C.: Synchronizing sequences and symbolic traversal techniques in test generation. J. Electronic Testing 4, 19–31 (1993)

    Article  Google Scholar 

  • Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  • Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  • Fischler, M.A., Tannenbaum, M.: Synchronizing and representation problems for sequential machines with masked outputs. In: Proc. 11th Annual Symp. Foundations Comput. Sci., pp. 97–103. IEEE, Los Alamitos (1970)

    Google Scholar 

  • Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb. 3, 125–127 (1982)

    MATH  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)

    Google Scholar 

  • Gill, A.: State-identification experiments in finite automata. Information and Control 4(2-3), 132–154 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  • Ginsburg, S.: On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. J. Assoc. Comput. Mach. 5, 266–280 (1958)

    MATH  MathSciNet  Google Scholar 

  • Goldberg, K.: Orienting polygonal parts without sensors. Algorithmica 10, 201–225 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  • Goralčik, P., Koubek, V.: Rank problems for composite transformations. Int. J. Algebra and Computation 5, 309–316 (1995)

    Article  MATH  Google Scholar 

  • Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proc. 5th Annual Symp. Switching Circuit Theory and Logical Design, pp. 95–110. IEEE, Los Alamitos (1964)

    Chapter  Google Scholar 

  • Hennie, F.C.: Finite-state Models for Logical Machines. J. Wiley & Sons, New York (1968)

    MATH  Google Scholar 

  • Higgins, P.M.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum 37, 31–36 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  • Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. EATCS Bull. 73, 146 (2001)

    MATH  MathSciNet  Google Scholar 

  • Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci. 295, 223–232 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Klyachko, A.A., Rystsov, I.K., Spivak, M.A.: An extremal combinatorial problem associated with the bound of the length of a synchronizing word in an automaton. Kibernetika 25(2), 16–20 (1987) (in Russian); English translation: Cybernetics and Systems Analysis 23(2), 165–171

    MathSciNet  Google Scholar 

  • Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill, New York (1970)

    MATH  Google Scholar 

  • Kohavi, Z., Winograd, J.: Bounds on the length of synchronizing sequences and the order of information losslessness. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 197–206. Academic Press, New York (1971)

    Google Scholar 

  • Kohavi, Z., Winograd, J.: Establishing certain bounds concerning finite automata. J. Comput. Syst. Sci. 7(3), 288–299 (1973)

    MATH  MathSciNet  Google Scholar 

  • Laemmel, A.E., Rudner, B.: Study of the application of coding theory, Report PIBEP-69-034, Polytechnic Inst. Brooklyn, Dept. Electrophysics, Farmingdale (1969)

    Google Scholar 

  • Mateescu, A., Salomaa, A.: Many-valued truth functions, Černý’s conjecture and road coloring. EATCS Bull. 68, 134–150 (1999)

    MATH  MathSciNet  Google Scholar 

  • McNaughton, R., Papert, S.A.: Counter-free Automata. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  • Moore, E.F.: Gedanken-experiments on sequential machines. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, Annals of Mathematics Studies, vol. 34, pp. 129–153. Princeton University Press, Princeton (1956)

    Google Scholar 

  • Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: Proc. 27th Annual Symp. Foundations Comput. Sci., pp. 132–142. IEEE, Los Alamitos (1986)

    Google Scholar 

  • Natarajan, B.K.: Some paradigms for the automated design of parts feeders. Internat. J. Robotics Research 8(6), 89–109 (1989)

    Google Scholar 

  • Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  • Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535–548 (1983)

    MATH  Google Scholar 

  • Pixley, C., Jeong, S.-W., Hachtel, G.D.: Exact calculation of synchronization sequences based on binary decision diagrams. In: Proc. 29th Design Automation Conf., pp. 620–623. IEEE, Los Alamitos (1992)

    Chapter  Google Scholar 

  • Rho, J.-K., Somenzi, F., Pixley, C.: Minimum length synchronizing sequences of finite state machine. In: Proc. 30th Design Automation Conf., pp. 463–468. ACM, New York (1993)

    Google Scholar 

  • Salomaa, A.: Composition sequences for functions over a finite domain. Theoret. Comput. Sci. 292, 263–281 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Samotij, W.: A note on the complexity of the problem of finding shortest synchronizing words. In: Proc. AutoMathA 2007, Automata: from Mathematics to Applications, Univ. Palermo (CD) (2007)

    Google Scholar 

  • Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)

    Google Scholar 

  • Starke, P.H.: Eine Bemerkung über homogene Experimente. Elektronische Informationverarbeitung und Kybernetik 2, 257–259 (1966) (in German)

    MATH  Google Scholar 

  • Starke, P. H.: Abstrakte Automaten, Deutscher Verlag der Wissenschaften, Berlin (1969) (in German); English translation: Abstract Automata, North-Holland, Amsterdam, American. Elsevier, New York (1972)

    Google Scholar 

  • Trahtman, A.: An efficient algorithm finds noticeable trends and examples concerning the Černý conjecture. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 789–800. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  • Trahtman, A.: The Černý conjecture for aperiodic automata. Discrete Math. Theoret. Comp. Sci. 9(2), 3–10 (2007)

    MATH  MathSciNet  Google Scholar 

  • Trahtman, A.: The Road Coloring Problem. Israel J. Math. (to appear, 2008), http://arxiv.org/abs/0709.0099

  • Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 27–37. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  • Yang, S.: Logic Synthesis and Optimization Benchmarks User Guide Version 3.0, Microelectronics Center of North Carolina, Research Triangle Park, NC (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Mechanics, Ural State University, 620083, Ekaterinburg, Russia

    Mikhail V. Volkov

Authors
  1. Mikhail V. Volkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Volkov, M.V. (2008). Synchronizing Automata and the Černý Conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation