genaut: introduce --m-nba

* bin/genaut.cc: Implement the --m-nba option.
* spot/gen/automata.hh, spot/gen/automata.cc: Add the generation code.
* NEWS, bin/man/genaut.x: Document it.
* doc/org/genaut.org: Update.
* tests/core/genaut.test, tests/core/parity2.test: Add some tests.

bin/genaut.cc

@@ -1,5 +1,5 @@
 // -*- coding: utf-8 -*-
-// Copyright (C) 2017, 2018 Laboratoire de Recherche et Développement
+// Copyright (C) 2017-2019 Laboratoire de Recherche et Développement
 // de l'Epita (LRDE).
 //
 // This file is part of Spot, a model checking library.
@@ -59,6 +59,9 @@ static const argp_option options[] =
     { "l-dsa", gen::AUT_L_DSA, "RANGE", 0,
       "A deterministic Streett automaton with 4N states with no "
       "equivalent deterministic Rabin automaton of less than N! states.", 0},
+    { "m-nba", gen::AUT_M_NBA, "RANGE", 0,
+      "An NBA with N+1 states whose determinization needs at least "
+      "N! states", 0},
     RANGE_DOC,
   /**************************************************/
     { nullptr, 0, nullptr, 0, "Miscellaneous options:", -1 },

bin/man/genaut.x

@@ -12,6 +12,10 @@ Automata.  Proceedings of ICALP'15.
 l
 C. Löding: Optimal Bounds for Transformations of ω-Automata.
 Proceedings of FSTTCS'99.
+.TP
+m
+M. Michel: Complementation is more difficult with automata on
+infinite words.  CNET, Paris (1988).  Unpublished manuscript.
 
 [SEE ALSO]
 .BR autfilt (1),