All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.automatalib.util.ts.acceptors.DetAcceptorComposition Maven / Gradle / Ivy

Go to download

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

There is a newer version: 0.11.0
Show newest version
/* Copyright (C) 2013 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 * 
 * AutomataLib is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License version 3.0 as published by the Free Software Foundation.
 * 
 * AutomataLib is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with AutomataLib; if not, see
 * http://www.gnu.de/documents/lgpl.en.html.
 */
package net.automatalib.util.ts.acceptors;

import net.automatalib.commons.util.IPair;
import net.automatalib.ts.acceptors.DeterministicAcceptorTS;
import net.automatalib.ts.comp.DTSComposition;

public class DetAcceptorComposition, A2 extends DeterministicAcceptorTS>
		extends DTSComposition implements DeterministicAcceptorTS, I> {

	private final AcceptanceCombiner combiner;
	
	public DetAcceptorComposition(A1 ts1, A2 ts2, AcceptanceCombiner combiner) {
		super(ts1, ts2, true);
		this.combiner = combiner;
	}
	
	@Override
	public boolean isAccepting(IPair state) {
		S1 s1 = state.getFirst();
		S2 s2 = state.getSecond();
		boolean acc1 = (s1 == null) ? false : ts1.isAccepting(s1);
		boolean acc2 = (s2 == null) ? false : ts2.isAccepting(s2);
		return combiner.combine(acc1, acc2);
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy