Document Open Access Logo

Lower Bounds for Unambiguous Automata via Communication Complexity

Authors Mika Göös, Stefan Kiefer, Weiqiang Yuan

Thumbnail PDF


  • Filesize: 0.75 MB
  • 13 pages

Document Identifiers

Author Details

Mika Göös
  • EPFL, Lausanne, Switzerland
Stefan Kiefer
  • University of Oxford, UK
Weiqiang Yuan
  • EPFL, Lausanne, Switzerland


We thank anonymous ICALP reviewers for many comments.

Cite AsGet BibTex

Mika Göös, Stefan Kiefer, and Weiqiang Yuan. Lower Bounds for Unambiguous Automata via Communication Complexity. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 126:1-126:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)


We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ̅L requires NFAs with n^Ω̃(log n) states. This improves on a lower bound by Raskin. 2) Union: There are languages L₁, L₂ recognised by n-state UFAs such that the union L₁∪L₂ requires UFAs with n^Ω̃(log n) states. 3) Separation: There is a language L such that both L and ̅L are recognised by n-state NFAs but such that L requires UFAs with n^Ω(log n) states. This refutes a conjecture by Colcombet.

Subject Classification

ACM Subject Classification
  • Theory of computation → Regular languages
  • Unambiguous automata
  • communication complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Noga Alon. Problems and results in extremal combinatorics-I. Discrete Mathematics, 273(1-3):31-53, 2003. URL:
  2. Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, and Robin Kothari. Unambiguous DNFs and Alon-Saks-Seymour. In 62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2021. To appear. Available at URL:
  3. Jean-Camille Birget. Partial orders on words, minimal elements of regular languages, and state complexity. Theoretical Computer Science, 119(2):267-291, 1993. URL:
  4. Mikołaj Bojańczyk and Wojciech Czerwiński. An automata toolbox, 2018. Available at URL:
  5. Thomas Colcombet. Unambiguity in automata theory. In 17th International Workshop on Descriptional Complexity of Formal Systems (DCFS), volume 9118 of Lecture Notes in Computer Science, pages 3-18. Springer, 2015. URL:
  6. Thomas Colcombet, Karin Quaas, and Michał Skrzypczak. Unambiguity in Automata Theory (Dagstuhl Seminar 21452). Dagstuhl Reports, 11(10):57-71, 2022. URL:
  7. Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdziński, Ranko Lazić, and Pawel Parys. Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2333-2349, 2019. URL:
  8. Wojciech Czerwiński and Sławomir Lasota. Regular separability of one counter automata. Logical Methods in Computer Science, 15(2), 2019. URL:
  9. Yuan Gao, Nelma Moreira, Rogério Reis, and Sheng Yu. A survey on operational state complexity. Journal of Automata, Languages and Combinatorics, 21(4):251-310, 2016. URL:
  10. Mika Göös. Lower bounds for clique vs. independent set. In IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 1066-1076. IEEE Computer Society, 2015. URL:
  11. Mika Göös, T.S. Jayram, Toniann Pitassi, and Thomas Watson. Randomized communication versus partition number. ACM Transactions on Computation Theory (TOCT), 10(1):1-20, 2018. URL:
  12. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman. Rectangles are nonnegative juntas. SIAM Journal on Computing, 45(5):1835-1869, 2016. URL:
  13. Emil Indzhev and Stefan Kiefer. On complementing unambiguous automata and graphs with many cliques and cocliques. Technical report,, 2021. Available at URL:
  14. Galina Jirásková. State complexity of some operations on binary regular languages. Theoretical Computer Science, 330(2):287-298, 2005. URL:
  15. Jozef Jirásek Jr., Galina Jirásková, and Juraj Šebej. Operations on unambiguous finite automata. International Journal of Foundations of Computer Science, 29(5):861-876, 2018. URL:
  16. Gillat Kol, Shay Moran, Amir Shpilka, and Amir Yehudayoff. Approximate nonnegative rank is equivalent to the smooth rectangle bound. Computational Complexity, 28(1):1-25, 2019. Preliminary version in ICALP '14. URL:
  17. Pravesh Kothari, Raghu Meka, and Prasad Raghavendra. Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs. SIAM Journal on Computing, pages STOC17-305-STOC17-332, May 2021. Preliminary version in STOC '17. URL:
  18. Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, 1997. URL:
  19. Anup Rao and Amir Yehudayoff. Communication Complexity: And Applications. Cambridge University Press, 2020. URL:
  20. Mikhail Raskin. A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), volume 107 of Leibniz International Proceedings in Informatics (LIPIcs), pages 138:1-138:11, 2018. URL:
  21. Alexander Razborov. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica, 10(1):81-93, 1990. URL:
  22. Wikipedia. State complexity. URL:
  23. Mihalis Yannakakis. Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences, 43(3):441-466, 1991. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail