| tech,15-7-P97-1040,ak | <term> factored automata </term> , where <term> | regular languages | </term> are represented compactly via <term> | #29589 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. |
