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

net.automatalib.incremental.mealy.AbstractIncrementalMealyBuilder 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/.
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *     http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package net.automatalib.incremental.mealy;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Map;

import net.automatalib.graphs.dot.DefaultDOTHelper;
import net.automatalib.graphs.dot.GraphDOTHelper;
import net.automatalib.words.Alphabet;
import net.automatalib.words.Word;
import net.automatalib.words.WordBuilder;

public abstract class AbstractIncrementalMealyBuilder implements
		IncrementalMealyBuilder {
	
	public abstract static class AbstractGraphView
			implements GraphView {
		@Override
		public GraphDOTHelper getGraphDOTHelper() {
			return new DefaultDOTHelper() {
				@Override
				public Collection initialNodes() {
					return Collections.singleton(getInitialNode());
				}
				@Override
				public boolean getEdgeProperties(N src, E edge, N tgt,
						Map properties) {
					if(!super.getEdgeProperties(src, edge, tgt, properties)) {
						return false;
					}
					I input = getInputSymbol(edge);
					O output = getOutputSymbol(edge);
					properties.put(EdgeAttrs.LABEL, input + " / " + output);
					return true;
				}
				
			};
		}
	}
	
	protected Alphabet inputAlphabet;
	
	public AbstractIncrementalMealyBuilder(Alphabet alphabet) {
		this.inputAlphabet = alphabet;
	}
	
	@Override
	public Alphabet getInputAlphabet() {
		return inputAlphabet;
	}

	@Override
	public boolean hasDefinitiveInformation(Word word) {
		List unused = new ArrayList<>(word.length());
		return lookup(word, unused);
	}

	@Override
	public Word lookup(Word inputWord) {
		WordBuilder wb = new WordBuilder<>(inputWord.size());
		lookup(inputWord, wb);
		return wb.toWord();
	}

}