de.learnlib.algorithm.aaar.abstraction.Node Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of learnlib-aaar Show documentation

This artifact provides the implementation of the AAAR learning algorithm as described in the paper "Automata Learning with Automated Alphabet Abstraction Refinement" (https://dx.doi.org/10.1007/978-3-642-18275-4_19) by Falk Howar, Bernhard Steffen, and Maik Merten.

The newest version!

/* Copyright (C) 2013-2023 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 *
 * 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 de.learnlib.algorithm.aaar.abstraction;

import net.automatalib.word.Word;

class Node {

    static class InnerNode extends Node {

        final Word prefix;
        final Word suffix;
        final D out;

        Node equalsNext;
        Node otherNext;

        InnerNode(Word prefix, Word suffix, D out, Node equalsNext, Node otherNext) {
            this.prefix = prefix;
            this.suffix = suffix;
            this.out = out;
            this.equalsNext = equalsNext;
            this.otherNext = otherNext;
        }
    }

    static class Leaf extends Node {

        final AI abs;
        final CI rep;

        Leaf(AI abs, CI rep) {
            this.abs = abs;
            this.rep = rep;
        }
    }
}