marcel@ADS.COM (Marcel Schoppers) (06/01/90)
This problem might have been studied both under graph theory and under automata theory: To convert a graph or automaton into its dual you map edges/arcs of the input structure into vertices/states of the dual structure, and vertices/states of the input structure into edges/arcs of the dual. The Question: If you know something about the input structure, what do you know about the dual? Of particular interest is what you know about the dual when the input structure is an automaton that accepts a prefix-closed or suffix-closed language. Can someone give me a reference on the properties of duals? Marcel