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

net.automatalib.incremental.mealy.IncrementalMealyBuilder Maven / Gradle / Ivy

Go to download

A library for incremental automata construction. This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

There is a newer version: 0.11.0
Show newest version
/* Copyright (C) 2014 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.incremental.mealy;

import java.util.List;

import javax.annotation.Nonnull;
import javax.annotation.Nullable;

import net.automatalib.automata.transout.MealyMachine;
import net.automatalib.graphs.dot.DOTPlottableGraph;
import net.automatalib.incremental.ConflictException;
import net.automatalib.incremental.IncrementalConstruction;
import net.automatalib.ts.transout.MealyTransitionSystem;
import net.automatalib.words.Word;

public interface IncrementalMealyBuilder extends IncrementalConstruction, I> {

	public static interface GraphView extends DOTPlottableGraph {
		@Nullable
		public I getInputSymbol(@Nonnull E edge);
		@Nullable
		public O getOutputSymbol(@Nonnull E edge);
		@Nonnull
		public N getInitialNode();
	}
	
	public static interface TransitionSystemView extends MealyTransitionSystem {
	}
	
	public Word lookup(Word inputWord);
	public boolean lookup(Word inputWord, List output);
	public void insert(Word inputWord, Word outputWord) throws ConflictException;
	
	@Override
	public TransitionSystemView asTransitionSystem();
	
	@Override
	public GraphView asGraph();
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy