rationals.transformations.CompleteNop Maven / Gradle / Ivy
Show all versions of org.semanticweb.hermit Show documentation
/*______________________________________________________________________________
*
* Copyright 2005 Arnaud Bailly - NORSYS/LIFL
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* (1) Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* (2) Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* (3) The name of the author may not be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Created on 12 avr. 2005
*
*/
package rationals.transformations;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import rationals.Automaton;
import rationals.NoSuchStateException;
import rationals.State;
import rationals.Transition;
/**
* This methods completes the transitions in an Automaton w.r.t. to an
* arbitrary alphabet.
*
* That is, for each state q and for each letter l
* in ioa's alphabet, if there is no transition labelled with
* l starting from q, it adds a transition
* (q,l,q) to this automaton.
*
* The semantic of this completion scheme should be compared with
* {@link rationals.transformations.CompleteSink}which completes an automaton
* by adding a sink state.
*
*
* @author nono
* @version $Id: CompleteNop.java 6 2006-08-30 08:56:44Z oqube $
*/
public class CompleteNop implements UnaryTransformation {
private Set alphabet;
public CompleteNop(Set alphabet) {
this.alphabet = alphabet;
}
/*
* (non-Javadoc)
*
* @see rationals.transformations.UnaryTransformation#transform(rationals.Automaton)
*/
public Automaton transform(Automaton a) {
Automaton b = new Automaton();
Map qm = new HashMap();
for (Iterator i = a.states().iterator(); i.hasNext();) {
State q = (State) i.next();
State p = b.addState(q.isInitial(), q.isTerminal());
qm.put(q, p);
}
Set alph = new HashSet();
for (Iterator it = a.states().iterator(); it.hasNext();) {
State q = (State) it.next();
alph.addAll(alphabet);
for (Iterator i2 = a.delta(q).iterator(); i2.hasNext();) {
Transition tr = (Transition) i2.next();
try {
b.addTransition(new Transition((State) qm.get(tr.start()),
tr.label(), (State) qm.get(tr.end())));
} catch (NoSuchStateException e) {
}
alph.remove(tr.label());
}
for (Iterator i2 = alph.iterator(); i2.hasNext();) {
try {
b.addTransition(new Transition(q, i2.next(), q));
} catch (NoSuchStateException e) {
}
}
alph.clear();
}
return b;
}
}