AutomataUtils

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. val MaxSimultaneousProduct: Int

   

   The maximum number of automata to product simultaneously

5. def areConsistentAtomicAutomata(auts: Seq[AtomicStateAutomaton]): Boolean

   

   Check whether there is some word accepted by all of the given automata.

   Check whether there is some word accepted by all of the given automata. The automata are required to all have the same label type (though this is not checked statically)

6. def areConsistentAutomata(auts: Seq[Automaton]): Boolean

   

   Check whether there is some word accepted by all of the given automata.

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def buildEpsilons[State, TLabel](builder: AtomicStateAutomatonBuilder[State, TLabel], epsilons: MultiMap[State, State]): Unit

   

   Continue a build by providing epsilon transitions.

   Continue a build by providing epsilon transitions. Note, adding new transitions after calling this will invalidate the results of this function

   builder

   the builder to add transitions to

   epsilons

   epsilons(q) = set of q' where there is an e-transition from q to q'

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def concat(aut1: AtomicStateAutomaton, aut2: AtomicStateAutomaton): AtomicStateAutomaton

    

    Build automaton accepting concat language of given automata aut1 and aut2 must have compatible label types

11. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

14. def findAcceptedWord(auts: Seq[Automaton], len: Int): Option[Seq[Int]]

    

    Check whether there is some word of length len accepted by all of the given automata.

    Check whether there is some word of length len accepted by all of the given automata.

15. def findAcceptedWordAtomic(auts: Seq[AtomicStateAutomaton], len: Int): Option[Seq[Int]]

    

    Check whether there is some word of length len accepted by all of the given automata.

    Check whether there is some word of length len accepted by all of the given automata. The automata are required to all have the same label type (though this is not checked statically)

16. def findUnsatCore(oldAuts: Seq[Automaton], newAut: Automaton): Option[Seq[Automaton]]

    

    Check whether there is some word accepted by all of the given automata.

    Check whether there is some word accepted by all of the given automata. If the intersection is empty, return an unsatisfiable core. The method makes the assumption that oldAuts are consistent, but the status of the combination with newAut is unknown.

17. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

18. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

19. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

20. def makeCaseInsensitive(aut: AtomicStateAutomaton): AtomicStateAutomaton

    

    Make an automaton case-insensitive.

21. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

22. def nestAutomata(autOuter: AtomicStateAutomaton, toReplace: Char, autInner: AtomicStateAutomaton): AtomicStateAutomaton

    

    Inserts second automaton into the first replacing transitions over a give character.

    Inserts second automaton into the first replacing transitions over a give character. I.e. s1 --a--> s2 becomes s1 -->into aut / from final --> s2.

    Assumes autOuter and autInner have compatible label types

    This is approximate in that there is only a single copy of the inserted automaton, so ingoing and outgoing transitions are not mapped.

23. final def notify(): Unit

    

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

25. def product(auts: Seq[AtomicStateAutomaton]): AtomicStateAutomaton

    

    Form product of this automaton with given auts, returns a new automaton

26. def product(auts: Seq[Automaton], minimize: Boolean = false): Automaton

    

    Product of a number of given automata The minimize argument enable minimization of the product automaton.

27. def productWithMap(auts: Seq[AtomicStateAutomaton], minimize: Boolean = false): (AtomicStateAutomaton, Map[Any, Seq[Any]])

    

    Product of a number of given automata.

    Product of a number of given automata. Returns new automaton. Returns map from new states of result to (q0, [q1, ..., qn]) giving states of this and auts respectively

    The minimize argument enable minimization of the product automaton, which should only be used if the returned maps are not used.

28. def replaceTransitions[A <: AtomicStateAutomaton](aut: A, a: Char, states: Iterable[(AutomataUtils.replaceTransitions.A.State, AutomataUtils.replaceTransitions.A.State)]): AtomicStateAutomaton

    

    Replace a-transitions with new a-transitions between pairs of states

29. def reverse(aut: AtomicStateAutomaton): AtomicStateAutomaton

    

    Build automaton accepting reverse language of given automaton

30. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

31. def toString(): String

    

    Definition Classes

    AnyRef → Any

32. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

34. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )