Document Open Access Logo

Width of Non-deterministic Automata

Authors Denis Kuperberg, Anirban Majumdar

PDF
Thumbnail PDF

File

LIPIcs.STACS.2018.47.pdf
  • Filesize: 475 kB
  • 14 pages

Document Identifiers

Author Details

Denis Kuperberg
Anirban Majumdar

Cite AsGet BibTex

Denis Kuperberg and Anirban Majumdar. Width of Non-deterministic Automata. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.STACS.2018.47

Abstract

We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any accepted input. We describe an incremental determinisation construction on NFAs, which can be more efficient than the full powerset determinisation, depending on the width of the input NFA. This construction can be generalised to infinite words, and is particularly well-suited to coBüchi automata in this context. For coBüchi automata, this procedure can be used to compute either a deterministic automaton or a GFG one, and it is algorithmically more efficient in this last case. We show this fact by proving that checking whether a coBüchi automaton is determinisable by pruning is NP-complete. On finite or infinite words, we show that computing the width of an automaton is PSPACE-hard.
Keywords
  • width
  • non-deterministic automata
  • determinisation
  • good-for-games
  • complexity

Metrics

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

References

  1. Benjamin Aminof, Orna Kupferman, and Robby Lampert. Reasoning about online algorithms with weighted automata. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pages 835-844, 2009. Google Scholar
  2. Udi Boker, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. Nondeterminism in the presence of a diverse or unknown future. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, pages 89-100, 2013. Google Scholar
  3. Filippo Bonchi and Damien Pous. Checking NFA equivalence with bisimulations up to congruence. In The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, Rome, Italy - January 23 - 25, 2013, pages 457-468, 2013. Google Scholar
  4. Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan. Deciding parity games in quasipolynomial time. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 252-263, 2017. Google Scholar
  5. Thomas Colcombet. The theory of stabilisation monoids and regular cost functions. In Automata, languages and programming. Part II, volume 5556 of Lecture Notes in Comput. Sci., pages 139-150, Berlin, 2009. Springer. Google Scholar
  6. Thomas Colcombet. Forms of determinism for automata (invited talk). In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pages 1-23, 2012. Google Scholar
  7. E. Allen Emerson and Charanjit S. Jutla. The complexity of tree automata and logics of programs (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pages 328-337, 1988. Google Scholar
  8. Kousha Etessami. A hierarchy of polynomial-time computable simulations for automata. In CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings, pages 131-144, 2002. Google Scholar
  9. Thomas A. Henzinger and Nir Piterman. Solving games without determinization. In Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pages 395-410, 2006. Google Scholar
  10. Joachim Klein, David Müller, Christel Baier, and Sascha Klüppelholz. Are good-for-games automata good for probabilistic model checking? In Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings, pages 453-465, 2014. Google Scholar
  11. Denis Kuperberg and Michał Skrzypczak. On determinisation of good-for-games automata. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, pages 299-310, 2015. Google Scholar
  12. H. Leung. Structurally unambiguous finite automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4094 LNCS:198-207, 2006. cited By 1. Google Scholar
  13. Hing Leung. Separating exponentially ambiguous NFA from polynomially ambiguous NFA. In Kam-Wing Ng, Prabhakar Raghavan, N. V. Balasubramanian, and Francis Y. L. Chin, editors, Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, volume 762 of Lecture Notes in Computer Science, pages 221-229. Springer, 1993. Google Scholar
  14. HING LEUNG. Descriptional complexity of nfa of different ambiguity. International Journal of Foundations of Computer Science, 16(05):975-984, 2005. Google Scholar
  15. Christof Löding and Stefan Repke. Decidability results on the existence of lookahead delegators for NFA. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India, pages 327-338, 2013. Google Scholar
  16. Satoru Miyano and Takeshi Hayashi. Alternating finite automata on ω-words. Theoret. Comput. Sci., 32(3):321-330, 1984. Google Scholar
  17. Shmuel Safra. On the complexity of omega-automata. In 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pages 319-327, 1988. Google Scholar
  18. Andreas Weber and Helmut Seidl. On the degree of ambiguity of finite automata. Theoretical Computer Science, 88(2):325-349, 1991. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact