/*-
 * APT - Analysis of Petri Nets and labeled Transition systems
 * Copyright (C) 2015  Schlachter
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

package uniol.apt.adt.automaton;

import java.util.Set;

/**
 * Instances of this interface represent deterministic finite automatons. A deterministic finite automaton has an
 * alphabet. Every state has exactly one transition for each symbol in the alphabet and no other transitions. This means
 * especially that there are no epsilon transitions.
 * @author Uli Schlachter
 */
public interface DeterministicFiniteAutomaton extends FiniteAutomaton {
	@Override
	DFAState getInitialState();

	/**
	 * Get the alphabet of the automaton. All states must have transitions for each symbol in the alphabet.
	 * @return The alphabet.
	 */
	Set<Symbol> getAlphabet();
}

// vim: ft=java:noet:sw=8:sts=8:ts=8:tw=120
