| other,21-7-P97-1040,ak | </term> are represented compactly via <term> | formal intersections | </term> N ~ = IAi of <term> FSAs </term> . We | #29595 One avenue for future improvements is a new finite-state notion, factored automata, where regular languages are represented compactly via formal intersections N~=IAi of FSAs. |
