---

Generate.java

package gov.nasa.arc.ase.util.graph;

public class Generate {

/*
  public static Graph generate1(int nsets) {
    Graph g = new Graph();
    int nnodes = 1 << nsets;
    Node[] nodes = new Node[nnodes];

    g.setIntAttribute("nsets", nsets);
    g.setStringAttribute("type", "ba");
    g.setStringAttribute("ac", "nodes");
    
    for(int i = 0; i < nnodes; i++) {
      nodes[i] = new Node(g);
      StringBuffer label = new StringBuffer();
      for(int k = 0; k < nsets; k++)
    if((i & (1 << k)) != 0)
      label.append("acc"+k+"+");
      nodes[i].setStringAttribute("label", label.toString());
    }

    for(int i = 0; i < nnodes; i++)
      for(int j = 0; j < nnodes; j++) {
    int d = (i == nnodes - 1 ? 0 : i) | j;
    Edge e = new Edge(nodes[i], nodes[d], "-", "-", null);
    for(int k = 0; k < nsets; k++)
      if((j & (1 << k)) != 0)
        e.setBooleanAttribute("acc"+k, true);
      }

    Node n = nodes[nnodes - 1];
    n.setBooleanAttribute("accepting", true);
    g.setInit(n);

    return g;
  }
*/
  
  public static Graph generate(int nsets) {
  
    // nsets is number of accepting conditions
    // nnodes is number of nodes in automaton generated - numbered from 0
    
    int nnodes = nsets + 1;

    Node[] nodes = new Node[nnodes];
    Graph g = new Graph();

    g.setIntAttribute("nsets", nsets);
    g.setStringAttribute("type", "ba");
    g.setStringAttribute("ac", "nodes");

    for(int i = 0; i < nnodes; i++) {
      nodes[i] = new Node(g);
      StringBuffer label = new StringBuffer();

      for(int k = 0; k < i; k++)
        label.append("acc"+k+"+");

      nodes[i].setStringAttribute("label", label.toString());
    }
    
    Node n;

    for(int i = 0; i < nsets; i++) {
      n = nodes[i];
      n.setIntAttribute("lower_bound", i);  
      Edge e = new Edge(nodes[i], nodes[i], "-", "-", null);
      e.setBooleanAttribute("else", true);

      for(int j = i+1; j < nnodes; j++) {
        e = new Edge(nodes[i], nodes[j], "-", "-", null);

        for(int k = i; k < j; k++)
            e.setBooleanAttribute("acc"+k, true);
      }
    }

    n = nodes[nnodes - 1];
    n.setIntAttribute("lower_bound", 0);
    n.setBooleanAttribute("accepting", true);
    Edge e = new Edge(n, n, "-", "-", null);
    for(int k = 0; k < nsets; k++)
      e.setBooleanAttribute("acc"+k, true);
      
    for(int i = 0; i < nsets; i++) {
      e = new Edge(n, nodes[i], "-", "-", null);
      if(i == 0)
        e.setBooleanAttribute("else", true);
      else
        for(int k = 0; k < i; k++)
            e.setBooleanAttribute("acc"+k, true);
    }

    g.setInit(n);
//  g.setInit(nodes[0]);

    return g;
  }  
  public static void main(String[] args) {
    Graph g = generate(Integer.parseInt(args[0]));
    
    g.save();
  }  
}

---