29622048893

Committed 17 Jul 2026 11:59PM UTC coverage: 92.904% (-0.1%) from 93.039%

Build # 29622048893

Build Type

Pull #103

github

Committed by

web-flow

Commit Message

Merge 8e66953a6 into edbbaaaa4

Pull Request Pull Request #103: Distinguish between structural and semantic interpretations of automata

Coverage Stats

283 of 329 new or added lines in 48 files covered. (86.02%)

5 existing lines in 2 files now uncovered.

17595 of 18939 relevant lines covered (92.9%)

1.72 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

85.71

/core/src/main/java/net/automatalib/automaton/impl/UniversalCompactDetAutomaton.java

/* Copyright (C) 2013-2026 TU Dortmund University
 * This file is part of AutomataLib <https://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.automaton.impl;

import net.automatalib.alphabet.Alphabet;
import net.automatalib.automaton.AutomatonCreator;
import net.automatalib.automaton.MutableDeterministic;
import net.automatalib.automaton.MutableDeterministic.RegularAutomaton;

/**
 * A refinement of {@link UniversalCompactDet} that additionally implements
 * {@link MutableDeterministic.RegularAutomaton} so that structural determinism and finiteness coincides with semantic
 * determinism and finiteness.
 *
 * @param <I>
 *         input symbol type
 * @param <SP>
 *         state property type
 * @param <TP>
 *         transition property type
 */
public class UniversalCompactDetAutomaton<I, SP, TP> extends UniversalCompactDet<I, SP, TP>
        implements RegularAutomaton<Integer, I, CompactTransition<TP>, SP, TP> {

    public UniversalCompactDetAutomaton(Alphabet<I> alphabet) {
        super(alphabet);
    }

    public UniversalCompactDetAutomaton(Alphabet<I> alphabet, int stateCapacity) {
        super(alphabet, stateCapacity);
    }

    public static final class Creator<I, SP, TP>
            implements AutomatonCreator<UniversalCompactDetAutomaton<I, SP, TP>, I> {

        @Override
        public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet, int numStates) {
            return new UniversalCompactDetAutomaton<>(alphabet, numStates);
        }

        @Override
        public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet) {
            return new UniversalCompactDetAutomaton<>(alphabet);
        }
    }
}

1	/* Copyright (C) 2013-2026 TU Dortmund University
2	* This file is part of AutomataLib <https://automatalib.net>.
3	*
4	* Licensed under the Apache License, Version 2.0 (the "License");
5	* you may not use this file except in compliance with the License.
6	* You may obtain a copy of the License at
7	*
8	* http://www.apache.org/licenses/LICENSE-2.0
9	*
10	* Unless required by applicable law or agreed to in writing, software
11	* distributed under the License is distributed on an "AS IS" BASIS,
12	* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13	* See the License for the specific language governing permissions and
14	* limitations under the License.
15	*/
16	package net.automatalib.automaton.impl;
17
18	import net.automatalib.alphabet.Alphabet;
19	import net.automatalib.automaton.AutomatonCreator;
20	import net.automatalib.automaton.MutableDeterministic;
21	import net.automatalib.automaton.MutableDeterministic.RegularAutomaton;
22
23	/**
24	* A refinement of {@link UniversalCompactDet} that additionally implements
25	* {@link MutableDeterministic.RegularAutomaton} so that structural determinism and finiteness coincides with semantic
26	* determinism and finiteness.
27	*
28	* @param <I>
29	* input symbol type
30	* @param <SP>
31	* state property type
32	* @param <TP>
33	* transition property type
34	*/
35	public class UniversalCompactDetAutomaton<I, SP, TP> extends UniversalCompactDet<I, SP, TP>
36	implements RegularAutomaton<Integer, I, CompactTransition<TP>, SP, TP> {
37
38	public UniversalCompactDetAutomaton(Alphabet<I> alphabet) {
39	super(alphabet);	2✔
40	}	2✔
41
42	public UniversalCompactDetAutomaton(Alphabet<I> alphabet, int stateCapacity) {
43	super(alphabet, stateCapacity);	2✔
44	}	2✔
45
46	public static final class Creator<I, SP, TP>	2✔
47	implements AutomatonCreator<UniversalCompactDetAutomaton<I, SP, TP>, I> {
48
49	@Override
50	public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet, int numStates) {
51	return new UniversalCompactDetAutomaton<>(alphabet, numStates);	2✔
52	}
53
54	@Override
55	public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet) {
NEW 56	return new UniversalCompactDetAutomaton<>(alphabet);	×
57	}
58	}
59	}

LearnLib / automatalib / 29622048893

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous