Skip to main content
SpringerLink
Log in

On Finitely Ambiguous Büchi Automata

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

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

Included in the following conference series:

Abstract

Unambiguous Büchi automata, i.e. Büchi automata allowing only one accepting run per word, are a useful restriction of Büchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous Büchi automata, a generalisation where each word has at most k accepting runs, for some fixed k. We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of \(\omega \)-languages and present a translation from arbitrary nondeterministic Büchi automata with n states to finitely ambiguous automata with at most \(3^n\) states and at most n accepting runs per word.

A. Pirogov—This work is supported by the German research council (DFG) Research Training Group 2236 UnRAVeL.

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 EPUB and 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

References

  1. Allauzen, C., Mohri, M., Rastogi, A.: General algorithms for testing the ambiguity of finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 108–120. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85780-8_8

    Chapter  Google Scholar 

  2. Arnold, A.: Rational \(\omega \)-languages are non-ambiguous. Theor. Comput. Sci. 26(1–2), 221–223 (1983)

    Article  Google Scholar 

  3. Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  4. Baier, C., Kiefer, S., Klein, J., Klüppelholz, S., Müller, D., Worrell, J.: Markov chains and unambiguous Büchi automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 23–42. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41528-4_2

    Chapter  Google Scholar 

  5. Bousquet, N., Löding, C.: Equivalence and inclusion problem for strongly unambiguous Büchi automata. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 118–129. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13089-2_10

    Chapter  MATH  Google Scholar 

  6. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Studies in Logic and the Foundations of Mathematics, vol. 44, pp. 1–11. Elsevier (1966)

    Google Scholar 

  7. Chan, T.H., Ibarra, O.H.: On the finite-valuedness problem for sequential machines. Theor. Comput. Sci. 23(1), 95–101 (1988)

    Article  MathSciNet  Google Scholar 

  8. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM 42(4), 857–907 (1995)

    Article  MathSciNet  Google Scholar 

  9. Couvreur, J.-M., Saheb, N., Sutre, G.: An optimal automata approach to LTL model checking of probabilistic systems. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol. 2850, pp. 361–375. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39813-4_26

    Chapter  Google Scholar 

  10. Isaak, D., Löding, C.: Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata. Inf. Process. Lett. 112(14–15), 578–582 (2012)

    Article  MathSciNet  Google Scholar 

  11. Kähler, D., Wilke, T.: Complementation, disambiguation, and determinization of Büchi automata unified. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 724–735. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70575-8_59

    Chapter  MATH  Google Scholar 

  12. Karmarkar, H., Joglekar, M., Chakraborty, S.: Improved upper and lower bounds for Büchi disambiguation. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 40–54. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-02444-8_5

    Chapter  MATH  Google Scholar 

  13. Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073–1082 (1998)

    Article  MathSciNet  Google Scholar 

  14. Safra, S.: On the complexity of omega-automata. In: Foundations of Computer Science 29th Annual Symposium on 1988, pp. 319–327. IEEE (1988)

    Google Scholar 

  15. Stearns, R.E., Hunt III, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput. 14(3), 598–611 (1985)

    Article  MathSciNet  Google Scholar 

  16. Thomas, W.: Languages, Automata, and Logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389–455. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_7

    Chapter  Google Scholar 

  17. Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theor. Comput. Sci. 88(2), 325–349 (1991)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen University, Templergraben 55, 52062, Aachen, Germany

    Christof Löding & Anton Pirogov

Authors
  1. Christof Löding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anton Pirogov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anton Pirogov .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Löding, C., Pirogov, A. (2018). On Finitely Ambiguous Büchi Automata. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation