001/* Copyright (C) 2013 TU Dortmund
002 * This file is part of AutomataLib, http://www.automatalib.net/.
003 * 
004 * AutomataLib is free software; you can redistribute it and/or
005 * modify it under the terms of the GNU Lesser General Public
006 * License version 3.0 as published by the Free Software Foundation.
007 * 
008 * AutomataLib is distributed in the hope that it will be useful,
009 * but WITHOUT ANY WARRANTY; without even the implied warranty of
010 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
011 * Lesser General Public License for more details.
012 * 
013 * You should have received a copy of the GNU Lesser General Public
014 * License along with AutomataLib; if not, see
015 * http://www.gnu.de/documents/lgpl.en.html.
016 */
017package net.automatalib.ts.acceptors;
018
019import net.automatalib.ts.UniversalTransitionSystem;
020
021/**
022 * A transition system whose semantics are defined by whether a state is "accepting"
023 * or not.
024 * 
025 * @author Malte Isberner <malte.isberner@gmail.com>
026 *
027 * @param <S> state class
028 * @param <I> input symbol class
029 */
030public interface AcceptorTS<S, I> extends UniversalTransitionSystem<S, I, S, Boolean, Void> {
031        
032        /**
033         * Checks whether the given state is accepting.
034         * @param state the state
035         * @return <code>true</code> if the state is accepting, <code>false</code>
036         * otherwise.
037         */
038        public boolean isAccepting(S state);
039        
040        /**
041         * Determines whether the given input word is accepted by this acceptor.
042         * @param input the input word.
043         * @return <code>true</code> if the input word is accepted,
044         * <code>false</code> otherwise. 
045         */
046        public boolean accepts(Iterable<I> input);
047}