Package de.up.ling.irtg.automata.condensed

Classes for "condensed" tree automata.

See: Description

Interface Summary

Interface	Description
GenericCondensedIntersectionAutomaton.IntersectionCall
NonCondensedIntersectionAutomaton.IntersectionCall

Class Summary

Class	Description
ConcatenatedIterable<E>
ConcreteCondensedTreeAutomaton<State>	This is an extension of CondensedTreeAutomaton for which all rules can and must be added externally and are then stored explicitly for quick access.
CondensedBottomUpIntersectionAutomaton<LeftState,RightState>	This automaton represents the intersection of two tree automaton, at least one of which is a condensed tree automaton.
CondensedIntersectionAutomaton<LeftState,RightState>	Intersecting two automatons using a CKY-algorithm.
CondensedNondeletingInverseHomAutomaton<State>	A tree automaton that describes the homomorphic pre-image of the language of another tree automaton.
CondensedRule
CondensedRuleTrie	A recursively defined Trie for CondensedRules
CondensedTreeAutomaton<State>
CondensedTreeAutomatonParser	Parser for bottom-up automata
CondensedViterbiIntersectionAutomaton<LeftState,RightState>	Intersecting two automatons, but saving only the one best path.
GenericCondensedIntersectionAutomaton<LeftState,RightState>	Computes an automaton for the intersection of an ordinary TreeAutomaton (left) and a CondensedTreeAutomaton (right).
NonCondensedIntersectionAutomaton<LeftState,RightState>	A variant of GenericCondensedIntersectionAutomaton that expands each condensed rule into the individual ordinary rules it represents.
PatternMatchingInvhomAutomatonFactory<MatcherState,State>	Produces pattern matcher automata to compute the inverse of decomposition automata under homomorphism.
PMFactoryRestrictive<State>	Produces pattern matcher automata to compute the inverse of decomposition automata under homomorphism.

Exception Summary

Exception	Description
ParseException	This exception is thrown when parse errors are encountered.

Package de.up.ling.irtg.automata.condensed Description

Classes for "condensed" tree automata. A rule of a condensed tree automaton can represent an entire set of ordinary tree automaton rules, which are identical except for the terminal symbol.

See Also:

CondensedTreeAutomaton