net.automatalib.ts.acceptors.AcceptorTS Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of automata-api Show documentation
Show all versions of automata-api Show documentation
This artifact contains the API of AutomataLib, which mainly consists of interfaces
for the various concepts and automaton models supported by the AutomataLib core.
In addition to that, it also defines some fundamental classes for dealing with
words of symbols.
/* 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.ts.acceptors;
import net.automatalib.ts.UniversalTransitionSystem;
/**
* A transition system whose semantics are defined by whether a state is "accepting"
* or not.
*
* @author Malte Isberner
*
* @param state class
* @param input symbol class
*/
public interface AcceptorTS extends UniversalTransitionSystem {
/**
* Checks whether the given state is accepting.
* @param state the state
* @return true
if the state is accepting, false
* otherwise.
*/
public boolean isAccepting(S state);
/**
* Determines whether the given input word is accepted by this acceptor.
* @param input the input word.
* @return true
if the input word is accepted,
* false
otherwise.
*/
public boolean accepts(Iterable input);
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy