AbstractCompact for deterministic automata.AbstractCompactDeterministic for transition-property-less automata.AbstractCompact for transition-property-less automata.unfoldTimes.ModelCheckerLasso that can unfold loops of lassos.CompactSimpleGraph.VPDAlphabet.DFAs.FastMealy automaton.FastMoore automaton.null when no such successor exists.VPDAlphabet implementation that allows to add new symbols after its construction.MealyMachines.HashMap, and adjacency information
for a single node is stored in data structures created via the provided supplier.HashSets.ModelChecker.findCounterExample(Object, Collection, Object) is called with a DFA with a size different, and
an input alphabet different than the previous call.GrowingAlphabet if possible (i.e. the given alphabet is actually an
instance of a GrowingAlphabet).AbstractCompactSimpleDeterministic-based implementation for automata that need to store generic state
properties.MutableAutomaton.addState().MutableAutomaton.addState() or AbstractCompact.addAlphabetSymbol(Object).VPDAlphabet.Copyright © 2019. All rights reserved.