Skip to main content
SpringerLink
Log in
Book cover

Automated Technology for Verification and Analysis pp 40–54Cite as

Improved Upper and Lower Bounds for Büchi Disambiguation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8172))

Abstract

We present a new ranking based construction for disambiguating non-deterministic Büchi automata and show that the state complexity tradeoff of the translation is in O(n·(0.76n)n). This exponentially improves the best upper bound (i.e., 4 ·(3n)n) known earlier for Büchi disambiguation. We also show that the state complexity tradeoff of translating non-deterministic Büchi automata to strongly unambiguous Büchi automata is in Ω((n − 1)!). This exponentially improves the previously known lower bound (i.e. Ω(2n)). Finally, we present a new tecúhnique to prove the already known exponential lower bound for disambiguating automata over finite or infinite words. Our technique is significantly simpler than earlier techniques based on ranks of matrices used for proving disambiguation lower bounds.

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

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

    Article  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  4. Colcombet, T., Zdanowski, K.: A tight lower bound for determinization of transition labeled Büchi automata. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 151–162. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. 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, Part I. LNCS, vol. 5125, pp. 724–735. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Karmarkar, H., Chakraborty, S.: On minimal odd rankings for Büchi complementation. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 228–243. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Karmarkar, H., Joglekar, M., Chakraborty, S.: Improved upper and lower bounds for Büchi disambiguation. Technical Report TR-13-36, Centre for Formal Design and Verification of Software, IIT Bombay (April 2013), http://www.cfdvs.iitb.ac.in/reports/index.php

  9. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic 2(3), 408–429 (2001)

    Article  MathSciNet  Google Scholar 

  10. Miyano, S., Hayashi, T.: Alternating finite automata on ω-words. Theor. Comput. Sci. 32, 321–330 (1984)

    Article  MathSciNet  Google Scholar 

  11. Preugschat, S., Wilke, T.: Effective characterizations of simple fragments of temporal logic using prophetic automata. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 135–149. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Schewe, S.: Büchi complementation made tight. In: Proc. STACS, pp. 661–672 (2009)

    Google Scholar 

  13. Schmidt, E.M.: Succinctness of Description of Context-Free, Regular and Unambiguous Language. PhD thesis, Cornell University (1978)

    Google Scholar 

  14. Yan, Q.: Lower bounds for complementation of ω-automata via the full automata technique. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 589–600. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, IIT Bombay, India

    Hrishikesh Karmarkar & Supratik Chakraborty

  2. Department of Computer Science, Stanford University, USA

    Manas Joglekar

Authors
  1. Hrishikesh Karmarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manas Joglekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Supratik Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Engineering and Technology, Vietnam National University, Xuan Thuy Street, 144, Hanoi, Vietnam

    Dang Van Hung

  2. School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan

    Mizuhito Ogawa

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Karmarkar, H., Joglekar, M., Chakraborty, S. (2013). Improved Upper and Lower Bounds for Büchi Disambiguation. In: Van Hung, D., Ogawa, M. (eds) Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol 8172. Springer, Cham. https://doi.org/10.1007/978-3-319-02444-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02444-8_5

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation