/* Copyright (C) 2013-2022 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.algorithms.spa.adapter;

import de.learnlib.acex.analyzers.AcexAnalyzers;
import de.learnlib.algorithms.kv.dfa.KearnsVaziraniDFA;
import de.learnlib.api.AccessSequenceTransformer;
import de.learnlib.api.oracle.MembershipOracle;
import net.automatalib.automata.fsa.impl.compact.CompactDFA;
import net.automatalib.words.Alphabet;
import net.automatalib.words.Word;

/**
 * Adapter for using {@link KearnsVaziraniDFA} as a sub-procedural learner.
 *
 * @param <I>
 *         input symbol type
 *
 * @author frohme
 */
public class KearnsVaziraniAdapter<I> extends KearnsVaziraniDFA<I> implements AccessSequenceTransformer<I> {

    public KearnsVaziraniAdapter(Alphabet<I> alphabet, MembershipOracle<I, Boolean> oracle) {
        super(alphabet, oracle, false, AcexAnalyzers.LINEAR_FWD);
    }

    @Override
    public Word<I> transformAccessSequence(Word<I> word) {

        @SuppressWarnings("unchecked")
        final CompactDFA<I> hypothesis = (CompactDFA<I>) super.getHypothesisModel();
        final Integer reachedState = hypothesis.getState(word);

        // we should only query defined paths
        assert reachedState != null;

        return super.stateInfos.get(reachedState).accessSequence;
    }

}

/* Copyright (C) 2013-2022 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.algorithms.spa.adapter;

import de.learnlib.acex.analyzers.AcexAnalyzers;
import de.learnlib.algorithms.kv.dfa.KearnsVaziraniDFA;
import de.learnlib.api.AccessSequenceTransformer;
import de.learnlib.api.oracle.MembershipOracle;
import net.automatalib.automata.fsa.impl.compact.CompactDFA;
import net.automatalib.words.Alphabet;
import net.automatalib.words.Word;

/**
 * Adapter for using {@link KearnsVaziraniDFA} as a sub-procedural learner.
 *
 * @param <I>
 *         input symbol type
 *
 * @author frohme
 */
public class KearnsVaziraniAdapter<I> extends KearnsVaziraniDFA<I> implements AccessSequenceTransformer<I> {

    public KearnsVaziraniAdapter(Alphabet<I> alphabet, MembershipOracle<I, Boolean> oracle) {
        super(alphabet, oracle, true, AcexAnalyzers.BINARY_SEARCH_FWD);
    }

    @Override
    public Word<I> transformAccessSequence(Word<I> word) {

        @SuppressWarnings("unchecked")
        final CompactDFA<I> hypothesis = (CompactDFA<I>) super.getHypothesisModel();
        final Integer reachedState = hypothesis.getState(word);

        // we should only query defined paths
        assert reachedState != null;

        return super.stateInfos.get(reachedState).accessSequence;
    }

}

use repeated + bin. fwd. CE analysis in KV adapter