Skip to main content
SpringerLink
Log in

Collapsing Words vs. Synchronizing Words

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

Abstract

We investigate the relationships between two types of words that have recently arisen in studying “black-box” versions of the famous Černý problem on synchronizing automata. Considering the languages formed by words of each of these types, we verify that one of them is regular while the other is not, thus showing that the two notions in question are different. We also discuss certain open problems concerning words of minimum length in these languages.

The authors acknowledge support from the Russian Education Ministry through the Grant Center at St Petersburg State University, grant E00-1.0-92, and from the INTAS through the Network project 99-1224 “Combinatorial and Geometric Theory of Groups and Semigroups and its Applications to Computer Science”.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Černý, J.: Poznámka k homogénnym eksperimentom s konecnými avtomatami. Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14 (1964) 208–216 [in Slovak].

    MATH  Google Scholar 

  2. Černý, J., Pirická, A., Rosenauerova, B.:Ondirectable automata.Kybernetika (Praha) 7 (1971) 289–298.

    MathSciNet  MATH  Google Scholar 

  3. Dubuc, L.: Les automates circulaires biases verifient la conjecture de Černý. RAIRO, Informatique Théorique et Applications 30 (1996) 495–505 [in French].

    MATH  MathSciNet  Google Scholar 

  4. Goehring, W.: Minimal initializing word:A contribution to Černý conjecture. J. Autom. Lang. Comb. 2 (1997) 209–226.

    MATH  MathSciNet  Google Scholar 

  5. Ito, M., Duske, J.: On cofinal and definite automata. Acta Cybernetica 6 (1983) 181–189.

    MATH  MathSciNet  Google Scholar 

  6. Kari, J.:Acounter example to a conjecture concerning synchronizingwords in finite automata. EATCS Bulletin 73 (2001) 146.

    Google Scholar 

  7. Margolis, S., Pin, J.-E., Volkov, M.V.:Words guaranteeing minimal image. Proc. III Internat. Colloq. onWords, Languages and Combinatorics, submitted.

    Google Scholar 

  8. Pin, J.-E.: Sur un cas particulier de la conjecture de Černý. Automata, Languages, Programming; 5th Colloq., Udine 1978, Lect. Notes Comput. Sci. 62 (1978) 345–352 [in French].

    Google Scholar 

  9. Pin, J.-E.: Le Problème de la Synchronisation. Contribution à l’Étude de la Conjecture de Černý. Thèse de 3éme cycle. Paris, 1978 [in French].

    Google Scholar 

  10. Pin, J.-E.: Sur les mots synchronisants dans un automate fini. Elektronische Informationverarbeitung und Kybernetik 14 (1978) 283–289 [in French].

    MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  12. Sauer, N., Stone, M. G.: Composing functions to reduce image size. Ars Combinatoria 31 (1991) 171–176.

    MATH  MathSciNet  Google Scholar 

  13. Starke, P. H.: Abstrakte Automaten. Berlin, 1969 [in German].

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    D. S. Ananichev & M. V. Volkov

Authors
  1. D. S. Ananichev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. V. Volkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ananichev, D.S., Volkov, M.V. (2002). Collapsing Words vs. Synchronizing Words. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation