DfaAlgorithms

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. def diff[A <: State](left: Dfa[A], right: Dfa[A]): Dfa[BiState[A]]

   

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

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def equivalent[A <: State](left: Dfa[A], right: Dfa[A]): Boolean

   

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

11. def fromNfa(nfa: Nfa, minimal: Boolean = false): Dfa[MultiState]

    

    Produce a DFA from a NFA using the 'power set construction' https://en.wikipedia.org/w/index.php?title=Powerset_construction&oldid=547783241

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. def intersect[A <: State](left: Dfa[A], right: Dfa[A]): Dfa[BiState[A]]

    

15. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

16. def isIntersectionNotEmpty[A <: State](left: Dfa[A], right: Dfa[A]): Boolean

    

17. def isProperSubset[A <: State](left: Dfa[A], right: Dfa[A]): Boolean

    

18. def isSubsetOf[A <: State](left: Dfa[A], right: Dfa[A]): Boolean

    

19. def matchString[A <: State](dfa: Dfa[A], string: String): (Boolean, Int)

    

20. def matchesAnything[A <: State](dfa: Dfa[A]): Boolean

    

    Return whether a DFA matches anything.

    Return whether a DFA matches anything. A DFA matches at least some language if there is a path from the initial state to any of the accepting states

21. def minimize(dfa: Dfa[SimpleState]): Dfa[SimpleState]

    

    DFA minimization, using Brzozowski's algorithm http://cs.stackexchange.com/questions/1872/brzozowskis-algorithm-for-dfa-minimization

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

    

    Definition Classes

    AnyRef

23. final def notify(): Unit

    

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

25. def removeUnreachableStates[A <: State](dfa: Dfa[A]): Dfa[A]

    

26. def reverse[A <: State](dfa: Dfa[A]): Nfa

    

27. def reverseAsDfa[A <: State](dfa: Dfa[A]): Dfa[MultiState]

    

28. def rewrite[A <: State, B <: State](dfa: Dfa[A], stateFactory: () ⇒ B): Dfa[B]

    

    Rewrite a DFA using canonical names for the states.

    Rewrite a DFA using canonical names for the states. Useful for simplifying the DFA product of intersections or NFA conversions. This function does not change the language matched by the DFA

29. def rewriteWithSimpleStates[A <: State](genericDfa: Dfa[A]): Dfa[SimpleState]

    

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

    

    Definition Classes

    AnyRef

31. def toNfa[A <: State](dfa: Dfa[A]): Nfa

    

    Each DFA is also trivially a NFA, return it.

32. def toString(): String

    

    Definition Classes

    AnyRef → Any

33. def union[A <: State](left: Dfa[A], right: Dfa[A]): Dfa[BiState[A]]

    

34. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )