| tech,28-7-P97-1040,ak | formal intersections </term> N ~ = IAi of <term> | FSAs | </term> . We investigate the problem of determining | #29602 One avenue for future improvements is a new finite-state notion, factored automata, where regular languages are represented compactly via formal intersections N~=IAi ofFSAs. |
