com.saxonica.ee.schema.fsa contains classes used to implement the finite state
machines used when validating document instances against a schema.
None of these classes will be used by typical user applications.
Interface Summary Interface Description StateA State is a dynamic state of the finite state machine.
Class Summary Class Description AutomatonStateDefines a state of a finite state machine used when validating an instance against a complex type. CountingStateA counting state is a dynamic object representing the combination of an AutomatonState and a counter value DeterminizedStateA state in a determinized finite state machine EdgeInternal class to represent the data associated with a transition: the element that triggers the transition, and the new state that results from the transition. Edge.MaxOccursParticle Edge.MaxOccursTermSpecial singular Term identifying a transition to be used when the maxOccurs value of a counting state is reached. FiniteStateMachineClass representing a finite state machine, as a collection of states with transitions between them. FiniteStateMachine.TermParticlePair NonDeterminizedStateA state in the non-determinized finite state machine SuffixStateThe state of a finite state machine that is processing "suffix" open content.