Skip to main content
SpringerLink
Log in

Unambiguous Automata on Bi-infinite Words

  • Conference paper
Mathematical Foundations of Computer Science 2003 (MFCS 2003)

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

  • 1101 Accesses

Abstract

We consider finite automata accepting bi-infinite words. We introduce unambiguous automata where each accepted word is the label of exactly one accepting path. We show that each rational set of bi-infinite words is accepted by such an automaton. This result is a counterpart of McNaughton’s theorem for bi-infinite words.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Arnold, A.: Rational ω-languages are non-ambiguous. Theoret. Comput. Sci. 26, 221–223 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Béal, M.-P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10, vol. 2. Springer, Heidelberg (1997)

    Google Scholar 

  3. Berstel, J., Boasson, L.: Context-free languages. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 2, vol. B, pp. 59–102. Elsevier, Amsterdam (1990)

    Google Scholar 

  4. Büchi, J.R.: 2–23. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem, pp. 2–23. North Holland, Amsterdam (1964)

    Google Scholar 

  5. Carton, O., Michel, M.: Unambiguous Büchi automata. Theoret. Comput. Sci. 297, 37–81 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  7. Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  8. McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Control 9, 521–530 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  9. Perrin, D., Pin, J.-É.: Infinite words (to appear), available at http://www.liafa.jussieu.fr/~jep/Resumes/InfiniteWords.html

  10. Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol. B, pp. 1–57. Elsevier, Amsterdam (1990)

    Google Scholar 

  11. Safra, S.: On the complexity of ω-automata. In: 29th Annual Symposium on Foundations of computer sciences, pp. 24–29 (1988)

    Google Scholar 

  12. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris 7,  

    Olivier Carton

Authors
  1. Olivier Carton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 842 48, Bratislava, Slovakia

    Branislav Rovan

  2. Charles University, Prague, Czech Republic

    Peter Vojtáš

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carton, O. (2003). Unambiguous Automata on Bi-infinite Words. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45138-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40671-6

  • Online ISBN: 978-3-540-45138-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation