automata

Type Members

1. abstract class ADotOption extends AnyRef

   

2. case class AMealy(alphabet: Set[String], states: Set[State], start: PosBool[State], transitions: Map[(State, Sign), PosBool[(B4, DirectedState)]]) extends Automaton with Product with Serializable

   

   Represents alternating Mealy machines with B4 as the set of outputs.

   Represents alternating Mealy machines with B4 as the set of outputs.

   alphabet

   the alphabet of the alternating Mealy machine

   states

   a set of the states of the alternating Mealy machine

   start

   a positive boolean combination representing the the initial states of the alternating Mealy machine

   transitions

   maps an actual states and an element of the alphabet onto a positive boolean combination as next states and an output

3. trait AffHelperParserCombinators extends JavaTokenParsers

   

4. trait AlphabetParserCombinators extends AffHelperParserCombinators

   

5. case class Apa(alphabet: Set[String], states: List[State], start: PosBool[State], transitions: Map[(State, Sign), PosBool[DirectedState]], colors: Map[State, Int]) extends Automaton with Product with Serializable

   

   Represents (2)APAs.

   Represents (2)APAs.

   alphabet

   the alphabet of the APA

   states

   a list of the states of the APA

   start

   a positive boolean formula describing the initial states of the APA

   transitions

   maps an actual states and an element of the alphabet onto a positive boolean combination describing the next states

   colors

   maps a state onto its color.

6. case class ApaSpecular(positive: Apa, negative: Apa) extends AutomatonSpecular with Product with Serializable

   

   Represents a pair of APAs

7. abstract class Automata extends AnyRef

   

8. sealed abstract class AutomataAlphabet[+A] extends AnyRef

   

   Created by Alex on 01.12.15.

   Created by Alex on 01.12.15.

   Represents an Alphabet. An Alphabet can either be a set of events or a set of propositions.

9. case class AutomataEvents[+A](values: List[A]) extends AutomataAlphabet[A] with Product with Serializable

   

10. class AutomataParserCombinators extends AlphabetParserCombinators

    

11. case class AutomataPropositions[+A](values: List[A]) extends AutomataAlphabet[A] with Product with Serializable

    

12. abstract class Automaton extends Automata

    

13. abstract class AutomatonSpecular extends Automata

    

14. sealed abstract class B3 extends AnyRef

    

    Represents the B3 = {top, ?, bot} truth domain.

15. sealed abstract class B4 extends AnyRef

    

    Represents the B4 = {top, ptop, pbot, bot} truth domain.

16. case class BoolAnd[+A](_1: PosBool[A], _2: PosBool[A]) extends PosBool[A] with Product with Serializable

    

    Represents a boolean "and" operator that connects two positive boolean formulas.

    Represents a boolean "and" operator that connects two positive boolean formulas.

    _1

    the first boolean formula.

    _2

    the second boolean formula.

17. case class BoolElement[+A](value: A) extends BoolPiece[A] with Product with Serializable

    

    Represents a general boolean element.

18. abstract class BoolOperator extends AnyRef

    

    Represents general boolean operators.

19. case class BoolOr[+A](_1: PosBool[A], _2: PosBool[A]) extends PosBool[A] with Product with Serializable

    

    Represents a boolean "or" operator that connects two positive boolean formulas.

    Represents a boolean "or" operator that connects two positive boolean formulas.

    _1

    the first boolean formula.

    _2

    the second boolean formula.

20. abstract class BoolPiece[+A] extends PosBool[A]

    

21. case class DirectedState(direction: Direction, state: State) extends Product with Serializable

    

22. abstract class Direction extends AnyRef

    

23. sealed case class DnfAtom[+A](value: A) extends DnfElement[A] with Product with Serializable

    

24. sealed abstract class DnfElement[+A] extends AnyRef

    

25. sealed case class DnfExpression[+A](terms: List[DnfTerm[A]]) extends Product with Serializable

    

26. case class DnfMoore(alphabet: AutomataAlphabet[String], states: Set[State], start: State, transitions: Map[State, Map[State, DnfExpression[String]]], labels: Map[State, B3]) extends Automaton with NameableStates[DnfMoore] with Product with Serializable

    

27. sealed case class DnfNot[+A](atom: DnfAtom[A]) extends DnfElement[A] with Product with Serializable

    

28. sealed case class DnfTerm[+A](elements: List[DnfElement[A]]) extends Product with Serializable

    

29. case class EqualIf[+A](condition: A) extends Equality[A] with Product with Serializable

    

30. abstract class Equality[+A] extends AnyRef

    

31. case class Fa[A, B, C](alphabet: Set[A], states: Set[State], start: State, transitions: Map[(State, A), (State, B)], output: Map[State, C]) extends Product with Serializable

    

    Represents deterministic one-way finite automata without epsilon transitions and other simplifications like transitions for any input.

    Represents deterministic one-way finite automata without epsilon transitions and other simplifications like transitions for any input. To represent all kinds of deterministic automata this class supports outputs in the states as well as output at the transitions.

32. case class Implicant(term: Map[String, Boolean], minterms: Set[Int]) extends Product with Serializable

    

33. case class Mealy(alphabet: Set[String], states: List[State], start: State, transitions: Map[(State, Sign), (B4, State)]) extends Automaton with Product with Serializable

    

    Represents Mealy machines with B4 as the set of outputs.

    Represents Mealy machines with B4 as the set of outputs.

    alphabet

    the alphabet of the Mealy machine

    states

    a set of the states of the Mealy machine

    start

    a positive boolean combination representing the the initial states of the Mealy machine

    transitions

    maps an actual states and an element of the alphabet onto a positive boolean combination as next states and an output

34. case class Moore(alphabet: Set[String], states: Set[State], start: State, transitions: Map[(State, Sign), State], labels: Map[State, B3]) extends Automaton with NameableStates[Moore] with Product with Serializable

    

    Represents Moore machines with B3 as the set of outputs.

    Represents Moore machines with B3 as the set of outputs.

    alphabet

    the alphabet of the Moore machine

    states

    a set of the states of the Moore machine

    start

    the initial state of the Moore machine

    transitions

    maps an actual states and an element of the alphabet onto a state as next state

    labels

    maps each state onto its output value.

35. trait NameableStates[A <: NameableStates[A]] extends AnyRef

    

36. case class Nba(alphabet: Set[String], states: List[State], start: List[State], transitions: Map[(State, Sign), List[DirectedState]], accepting: List[State]) extends Automaton with Product with Serializable

    

    Represents (2)NBAs.

    Represents (2)NBAs.

    alphabet

    the alphabet of the NBA

    states

    a list of the states of the NBA

    start

    a list of states containing the initial states of the NBA

    transitions

    maps an actual states and an element of the alphabet onto a list with the next states

    accepting

    a list of states containing the accepting states of the NBA

37. case class NbaSpecular(positive: Nba, negative: Nba) extends AutomatonSpecular with Product with Serializable

    

    Represents a pair of NBAs

    Represents a pair of NBAs

    positive

    the first NBA.

    negative

    the second NBA.

38. case class Nfa(alphabet: Set[String], states: List[State], start: List[State], transitions: Map[(State, Sign), List[DirectedState]], accepting: List[State]) extends Automaton with Product with Serializable

    

    Represents (2)NFAs.

    Represents (2)NFAs.

    alphabet

    the alphabet of the NFA

    states

    a list of the states of the NFA

    start

    a list of states containing the initial states of the NFA

    transitions

    maps an actual states and an element of the alphabet onto a list with the next states

    accepting

    a list of states containing the accepting states of the NFA

39. case class NfaSpecular(positive: Nfa, negative: Nfa) extends AutomatonSpecular with Product with Serializable

    

    Represents a pair of NFAs

    Represents a pair of NFAs

    positive

    the first NFA.

    negative

    the second NFA.

40. case class ParsingException(message: String) extends RuntimeException with Product with Serializable

    

41. abstract class PosBool[+A] extends AnyRef

    

    Represents a general positive boolean formula.

42. abstract class Sign extends AnyRef

    

43. case class SignNotFoundException(message: String) extends Exception with Product with Serializable

    

44. class State extends AnyRef

    

45. case class StateNotFoundException(message: String) extends Exception with Product with Serializable

    

46. case class Text(value: String) extends Sign with Product with Serializable