This document is the API specification for Scala 2.
Class Summary | |
abstract
|
class
BaseBerrySethi
this turns a regexp over A into a NondetWorkAutom over A using the celebrated position automata construction (also called Berry-Sethi or Glushkov) |
abstract
|
class
DetWordAutom
[T <: java.lang.Object]
A deterministic automaton. States are integers, where 0 is always the only initial state. Transitions are represented in the delta function. A default transitions is one that is taken when no other transition can be taken. All states are reachable. Accepting states are those for which the partial function 'finals' is defined. |
abstract
|
class
NondetWordAutom
[T <: java.lang.Object]
A nondeterministic automaton. States are integers, where 0 is always the only initial state. Transitions are represented in the delta function. Default transitions are transitions that are taken when no other transitions can be applied. All states are reachable. Accepting states are those for which the partial function 'finals' is defined. |
class
SubsetConstruction
[T <: java.lang.Object]
|
|
abstract
|
class
WordBerrySethi
This class turns a regexp into a NondetWordAutom using the celebrated position automata construction (also called Berry-Sethi or Glushkov) |
Trait Summary | |
abstract
|
trait
Inclusion
[A <: java.lang.Object]
A fast test of language inclusion between minimal automata. inspired by the AMoRE automata library |