Skip to main content
SpringerLink
Log in

Some Results on Directable Automata

  • Chapter
Theory Is Forever

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

Abstract

In this paper, we provide some properties of classes of regular languages consisting of directing words of directable automata and some new results on the shortest directing words of nondeterministic directable automata.

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. Burkhard, H.V.: Zum Längenproblem homogener experimente an determinierten und nicht-deterministischen automaten. Elektronische Informationsverarbeitung und Kybernetik, EIK 12, 301–306 (1976)

    MATH  MathSciNet  Google Scholar 

  2. Černý, J.: Poznámka k homogénym experimentom s konečinými automatami. Matematicko-fysikalny Časopis SAV 14, 208–215 (1964)

    MATH  Google Scholar 

  3. Imreh, B., Ito, M.: On some special classes of regular languages. In: Karhumäki, J., et al. (eds.) Jewels are Forever, pp. 25–34. Springer, New York (1999)

    Google Scholar 

  4. Imreh, B., Ito, M., Steinby, M.: On commutative directable nondeterministic automata. In: Martin-Vide, C., et al. (eds.) Grammars and Automata for Strings: From Mathematics and Computer Science to Biology, and Back, pp. 141–150. Taylor and Francis, London (2003)

    Google Scholar 

  5. Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybernetica 14, 105–115 (1999)

    MATH  MathSciNet  Google Scholar 

  6. Ito, M.: Algebraic Theory of Automata and Languages. World Scientific, Singapore (2004)

    Book  MATH  Google Scholar 

  7. Pin, J.-E.: Sur les mots synchronisants dans un automata fini. Elektronische Informationsverarbeitung und Kybernetik EIK 14, 297–303 (1978)

    MATH  MathSciNet  Google Scholar 

  8. Pin, J.-E.: Sur un cas particulier de la conjecture de Cerny, Automata, Lecture Notes in Computer Science 62 (Springer). In: Ausiello, G., Böhm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 345–352. Springer, Heidelberg (1978)

    Google Scholar 

  9. Rystsov, I.: Exact linear bound for the length of reset words in commutative automata. Publicationes Mathematicae of Debrecen 48, 405–409 (1996)

    MATH  MathSciNet  Google Scholar 

  10. Rystsov, I.: Reset words for commutative and solvable automata. Theoretical Computer Science 172, 273–279 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Kyoto Sangyo University, Kyoto, 603-8555, Japan

    Masami Ito

  2. Tenri University, Tenri, 619-0224, Japan

    Kayoko Shikishima-Tsuji

Authors
  1. Masami Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kayoko Shikishima-Tsuji
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. Institute for Information Systems and Computer Media (IICM), Graz University of Technology, A-8010, Graz, Austria

    Hermann Maurer

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ito, M., Shikishima-Tsuji, K. (2004). Some Results on Directable Automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27812-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22393-1

  • Online ISBN: 978-3-540-27812-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation