Package eas.math.fundamentalAlgorithms.graphBased.algorithms.turingMachine

Examples of eas.math.fundamentalAlgorithms.graphBased.algorithms.turingMachine.Turing


   
    public Turing generateTuring() {
        String init = this.initialState;
        HashSet<String> term = new HashSet<>(this.finalStates);
       
        Turing turing = new Turing(term, init, "*");
        turing.initializeTape(this.getInputAlphabet().toString().replace("[", "").replace("]", "").replace(", ", "")
                + this.getInputAlphabet().toString().replace("[", "").replace("]", "").replace(", ", ""));
       
        this.transitions.forEach(trans -> turing.addTransition(
                trans.getSource(),
                trans.getLabel(),
                trans.getDestination(),
                trans.getLabel(),
                1));
       
        turing.setRunStepsScript(turing.getTape().size() + 1);
       
        return turing;
    }
View Full Code Here


            ParCollection params) {
        super.runBeforeSimulation(umg, params);
        LinkedList<RepresentableAsGraph> list = new LinkedList<RepresentableAsGraph>();
        list.add(new FSM());
        list.add(new PDA());
        list.add(new Turing());
        list.add(new Grammar());
        list.add(new BDD());
        list.add(new Huffman());
        list.add(new PlainDOT());
        list.add(new PatTree());
View Full Code Here

TOP

Related Classes of eas.math.fundamentalAlgorithms.graphBased.algorithms.turingMachine.Turing

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.