@pattern-algebra/core 0.0.0

package/dist/automaton/emptiness.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Automaton emptiness checking and witness finding.
+ * @packageDocumentation
+ */
+import type { SegmentAutomaton } from '../types';
+/**
+ * Check if an automaton's language is empty.
+ *
+ * Uses reachability analysis from the initial state to any accepting state.
+ *
+ * @param automaton - The automaton to check
+ * @returns true if the automaton accepts no strings
+ *
+ * @public
+ */
+export declare function isEmpty(automaton: SegmentAutomaton): boolean;
+/**
+ * Find a witness string accepted by the automaton.
+ *
+ * If the automaton is non-empty, returns a path (sequence of segments)
+ * that leads to an accepting state.
+ *
+ * @param automaton - The automaton to find a witness for
+ * @returns A witness path string, or undefined if the language is empty
+ *
+ * @public
+ */
+export declare function findWitness(automaton: SegmentAutomaton): string | undefined;
+/**
+ * Count the number of accepting paths of a given length.
+ *
+ * Useful for understanding the "size" of a pattern's language.
+ *
+ * @param automaton - The automaton
+ * @param maxDepth - Maximum path length to consider
+ * @returns Object with counts per depth
+ *
+ * @public
+ */
+export declare function countPaths(automaton: SegmentAutomaton, maxDepth: number): Map<number, number>;
+//# sourceMappingURL=emptiness.d.ts.map

package/dist/automaton/emptiness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"emptiness.d.ts","sourceRoot":"","sources":["../../src/automaton/emptiness.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAuC,MAAM,UAAU,CAAA;AAErF;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,SAAS,EAAE,gBAAgB,GAAG,OAAO,CAW5D;AA6CD;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,gBAAgB,GAAG,MAAM,GAAG,SAAS,CAoF3E;AAsED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA4C7F"}

package/dist/automaton/emptiness.js

@@ -0,0 +1,262 @@
+/**
+ * Automaton emptiness checking and witness finding.
+ * @packageDocumentation
+ */
+/**
+ * Check if an automaton's language is empty.
+ *
+ * Uses reachability analysis from the initial state to any accepting state.
+ *
+ * @param automaton - The automaton to check
+ * @returns true if the automaton accepts no strings
+ *
+ * @public
+ */
+export function isEmpty(automaton) {
+    // Check if any accepting state is reachable from initial state
+    const reachable = findReachableStates(automaton);
+    for (const acceptingId of automaton.acceptingStates) {
+        if (reachable.has(acceptingId)) {
+            return false; // Found a reachable accepting state
+        }
+    }
+    return true; // No accepting state is reachable
+}
+/**
+ * Find all states reachable from the initial state.
+ */
+function findReachableStates(automaton) {
+    const reachable = new Set();
+    const worklist = [automaton.initialState];
+    while (worklist.length > 0) {
+        const stateId = worklist.pop();
+        if (reachable.has(stateId))
+            continue;
+        reachable.add(stateId);
+        const state = automaton.states[stateId];
+        if (!state)
+            continue;
+        for (const transition of state.transitions) {
+            const targets = getTransitionTargets(transition);
+            for (const target of targets) {
+                if (!reachable.has(target)) {
+                    worklist.push(target);
+                }
+            }
+        }
+    }
+    return reachable;
+}
+/**
+ * Get all target states from a transition.
+ */
+function getTransitionTargets(transition) {
+    switch (transition.type) {
+        case 'literal':
+        case 'wildcard':
+        case 'epsilon':
+            return [transition.target];
+        case 'globstar':
+            return [transition.selfLoop, transition.exit];
+    }
+}
+/**
+ * Find a witness string accepted by the automaton.
+ *
+ * If the automaton is non-empty, returns a path (sequence of segments)
+ * that leads to an accepting state.
+ *
+ * @param automaton - The automaton to find a witness for
+ * @returns A witness path string, or undefined if the language is empty
+ *
+ * @public
+ */
+export function findWitness(automaton) {
+    const visited = new Set();
+    const queue = [{ stateId: automaton.initialState, path: [] }];
+    // First, handle epsilon closure from initial state
+    const initialClosure = epsilonClosure(automaton, automaton.initialState);
+    for (const stateId of initialClosure) {
+        if (automaton.states[stateId]?.accepting) {
+            return '/'; // Empty path matches
+        }
+    }
+    // Add all states in initial closure to queue
+    for (const stateId of initialClosure) {
+        if (stateId !== automaton.initialState) {
+            queue.push({ stateId, path: [] });
+        }
+    }
+    while (queue.length > 0) {
+        const { stateId, path } = queue.shift();
+        if (visited.has(stateId))
+            continue;
+        visited.add(stateId);
+        const state = automaton.states[stateId];
+        if (!state)
+            continue;
+        // Check if this state is accepting
+        if (state.accepting && path.length > 0) {
+            return '/' + path.join('/');
+        }
+        // Explore transitions
+        for (const transition of state.transitions) {
+            if (transition.type === 'epsilon') {
+                // Epsilon: same path, different state
+                if (!visited.has(transition.target)) {
+                    queue.push({ stateId: transition.target, path });
+                }
+            }
+            else if (transition.type === 'literal') {
+                // Literal: extend path with the segment
+                if (!visited.has(transition.target)) {
+                    queue.push({
+                        stateId: transition.target,
+                        path: [...path, transition.segment],
+                    });
+                }
+            }
+            else if (transition.type === 'wildcard') {
+                // Wildcard: generate a sample segment that matches
+                const sample = generateMatchingSample(transition.pattern, transition.patternSource);
+                if (!visited.has(transition.target)) {
+                    queue.push({
+                        stateId: transition.target,
+                        path: [...path, sample],
+                    });
+                }
+            }
+            else if (transition.type === 'globstar') {
+                // Globstar exit: try exiting immediately (zero segments)
+                const exitClosure = epsilonClosure(automaton, transition.exit);
+                for (const exitState of exitClosure) {
+                    if (!visited.has(exitState)) {
+                        queue.push({ stateId: exitState, path });
+                    }
+                }
+                // Globstar self-loop: consume one segment and continue
+                if (!visited.has(transition.selfLoop)) {
+                    queue.push({
+                        stateId: transition.selfLoop,
+                        path: [...path, 'x'], // Generic segment
+                    });
+                }
+            }
+        }
+    }
+    return undefined; // No accepting state found
+}
+/**
+ * Compute epsilon closure from a single state.
+ */
+function epsilonClosure(automaton, startState) {
+    const closure = new Set();
+    const worklist = [startState];
+    while (worklist.length > 0) {
+        const stateId = worklist.pop();
+        if (closure.has(stateId))
+            continue;
+        closure.add(stateId);
+        const state = automaton.states[stateId];
+        if (!state)
+            continue;
+        for (const transition of state.transitions) {
+            if (transition.type === 'epsilon') {
+                if (!closure.has(transition.target)) {
+                    worklist.push(transition.target);
+                }
+            }
+            else if (transition.type === 'globstar') {
+                // Globstar exit is epsilon-reachable
+                if (!closure.has(transition.exit)) {
+                    worklist.push(transition.exit);
+                }
+            }
+        }
+    }
+    return closure;
+}
+/**
+ * Generate a sample segment that matches a pattern.
+ */
+function generateMatchingSample(pattern, patternSource) {
+    // Try to generate a sensible sample based on the pattern source
+    if (patternSource.includes('.ts')) {
+        return 'file.ts';
+    }
+    if (patternSource.includes('.js')) {
+        return 'file.js';
+    }
+    if (patternSource.startsWith('*.')) {
+        const ext = patternSource.slice(1);
+        return `sample${ext}`;
+    }
+    if (patternSource.endsWith('*')) {
+        const prefix = patternSource.slice(0, -1);
+        return `${prefix}sample`;
+    }
+    if (patternSource.startsWith('*')) {
+        const suffix = patternSource.slice(1);
+        return `sample${suffix}`;
+    }
+    // Default: try some common segments
+    const samples = ['file', 'dir', 'foo', 'bar', 'test', 'src', 'index.ts'];
+    for (const sample of samples) {
+        if (pattern.test(sample)) {
+            return sample;
+        }
+    }
+    return 'segment';
+}
+/**
+ * Count the number of accepting paths of a given length.
+ *
+ * Useful for understanding the "size" of a pattern's language.
+ *
+ * @param automaton - The automaton
+ * @param maxDepth - Maximum path length to consider
+ * @returns Object with counts per depth
+ *
+ * @public
+ */
+export function countPaths(automaton, maxDepth) {
+    const counts = new Map();
+    // Dynamic programming: count[state][depth] = number of paths
+    // This is exponential in worst case, so we cap at maxDepth
+    const memo = new Map();
+    const countFrom = (stateId, depth) => {
+        if (depth > maxDepth)
+            return 0;
+        const key = `${stateId}:${depth}`;
+        if (memo.has(key))
+            return memo.get(key);
+        const state = automaton.states[stateId];
+        if (!state)
+            return 0;
+        let total = 0;
+        // Count if accepting at this depth
+        if (state.accepting) {
+            total++;
+            counts.set(depth, (counts.get(depth) ?? 0) + 1);
+        }
+        // Count paths through transitions
+        for (const transition of state.transitions) {
+            if (transition.type === 'epsilon') {
+                total += countFrom(transition.target, depth);
+            }
+            else if (transition.type === 'globstar') {
+                total += countFrom(transition.exit, depth);
+                total += countFrom(transition.selfLoop, depth + 1);
+            }
+            else {
+                const target = transition.type === 'literal' || transition.type === 'wildcard' ? transition.target : 0;
+                total += countFrom(target, depth + 1);
+            }
+        }
+        memo.set(key, total);
+        return total;
+    };
+    countFrom(automaton.initialState, 0);
+    return counts;
+}
+//# sourceMappingURL=emptiness.js.map

package/dist/automaton/emptiness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"emptiness.js","sourceRoot":"","sources":["../../src/automaton/emptiness.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CAAC,SAA2B;IACjD,+DAA+D;IAC/D,MAAM,SAAS,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAA;IAEhD,KAAK,MAAM,WAAW,IAAI,SAAS,CAAC,eAAe,EAAE,CAAC;QACpD,IAAI,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/B,OAAO,KAAK,CAAA,CAAC,oCAAoC;QACnD,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA,CAAC,kCAAkC;AAChD,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,SAA2B;IACtD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IACnC,MAAM,QAAQ,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAA;IAEzC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAA;QAE/B,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAQ;QACpC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEtB,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK;YAAE,SAAQ;QAEpB,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,oBAAoB,CAAC,UAAU,CAAC,CAAA;YAChD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,UAA+B;IAC3D,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACxB,KAAK,SAAS,CAAC;QACf,KAAK,UAAU,CAAC;QAChB,KAAK,SAAS;YACZ,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QAC5B,KAAK,UAAU;YACb,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,CAAC,CAAA;IACjD,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAC,SAA2B;IAOrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAkB,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,YAAY,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;IAE5E,mDAAmD;IACnD,MAAM,cAAc,GAAG,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,YAAY,CAAC,CAAA;IACxE,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,IAAI,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC;YACzC,OAAO,GAAG,CAAA,CAAC,qBAAqB;QAClC,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,IAAI,OAAO,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;QACnC,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAExC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAQ;QAClC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEpB,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK;YAAE,SAAQ;QAEpB,mCAAmC;QACnC,IAAI,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC7B,CAAC;QAED,sBAAsB;QACtB,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YAC3C,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAClC,sCAAsC;gBACtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBACpC,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;gBAClD,CAAC;YACH,CAAC;iBAAM,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACzC,wCAAwC;gBACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBACpC,KAAK,CAAC,IAAI,CAAC;wBACT,OAAO,EAAE,UAAU,CAAC,MAAM;wBAC1B,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC;qBACpC,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;iBAAM,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC1C,mDAAmD;gBACnD,MAAM,MAAM,GAAG,sBAAsB,CAAC,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,aAAa,CAAC,CAAA;gBACnF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBACpC,KAAK,CAAC,IAAI,CAAC;wBACT,OAAO,EAAE,UAAU,CAAC,MAAM;wBAC1B,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC;qBACxB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;iBAAM,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC1C,yDAAyD;gBACzD,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,CAAC,CAAA;gBAC9D,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;oBACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC5B,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;oBAC1C,CAAC;gBACH,CAAC;gBAED,uDAAuD;gBACvD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACtC,KAAK,CAAC,IAAI,CAAC;wBACT,OAAO,EAAE,UAAU,CAAC,QAAQ;wBAC5B,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,kBAAkB;qBACzC,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAA,CAAC,2BAA2B;AAC9C,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,SAA2B,EAAE,UAAkB;IACrE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,QAAQ,GAAG,CAAC,UAAU,CAAC,CAAA;IAE7B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAA;QAE/B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAQ;QAClC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEpB,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK;YAAE,SAAQ;QAEpB,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YAC3C,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBACpC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;gBAClC,CAAC;YACH,CAAC;iBAAM,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC1C,qCAAqC;gBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,OAAgC,EAAE,aAAqB;IACrF,gEAAgE;IAChE,IAAI,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,IAAI,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,IAAI,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAClC,OAAO,SAAS,GAAG,EAAE,CAAA;IACvB,CAAC;IACD,IAAI,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACzC,OAAO,GAAG,MAAM,QAAQ,CAAA;IAC1B,CAAC;IACD,IAAI,aAAa,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QACrC,OAAO,SAAS,MAAM,EAAE,CAAA;IAC1B,CAAC;IAED,oCAAoC;IACpC,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAA;IACxE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,OAAO,MAAM,CAAA;QACf,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CAAC,SAA2B,EAAE,QAAgB;IACtE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IAExC,6DAA6D;IAC7D,2DAA2D;IAE3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IAEtC,MAAM,SAAS,GAAG,CAAC,OAAe,EAAE,KAAa,EAAU,EAAE;QAC3D,IAAI,KAAK,GAAG,QAAQ;YAAE,OAAO,CAAC,CAAA;QAE9B,MAAM,GAAG,GAAG,GAAG,OAAO,IAAI,KAAK,EAAE,CAAA;QACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAA;QAExC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAA;QAEpB,IAAI,KAAK,GAAG,CAAC,CAAA;QAEb,mCAAmC;QACnC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACpB,KAAK,EAAE,CAAA;YACP,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACjD,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YAC3C,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAClC,KAAK,IAAI,SAAS,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;YAC9C,CAAC;iBAAM,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC1C,KAAK,IAAI,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAC1C,KAAK,IAAI,SAAS,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;YACpD,CAAC;iBAAM,CAAC;gBACN,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;gBACtG,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACpB,OAAO,KAAK,CAAA;IACd,CAAC,CAAA;IAED,SAAS,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC,CAAA;IACpC,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/automaton/emptiness.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=emptiness.test.d.ts.map

package/dist/automaton/emptiness.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"emptiness.test.d.ts","sourceRoot":"","sources":["../../src/automaton/emptiness.test.ts"],"names":[],"mappings":""}

package/dist/automaton/emptiness.test.js

@@ -0,0 +1,154 @@
+import { describe, it, expect } from 'vitest';
+import { isEmpty, findWitness, countPaths } from './emptiness';
+import { buildAutomaton } from '../compile/automaton-builder';
+import { parsePattern } from '../parse';
+import { compilePattern } from '../compile';
+import { matchPath } from '../match';
+describe('isEmpty', () => {
+    describe('non-empty automata', () => {
+        it('returns false for simple pattern', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            expect(isEmpty(automaton)).toBe(false);
+        });
+        it('returns false for wildcard pattern', () => {
+            const pattern = parsePattern('*.ts');
+            const automaton = buildAutomaton(pattern);
+            expect(isEmpty(automaton)).toBe(false);
+        });
+        it('returns false for globstar pattern', () => {
+            const pattern = parsePattern('**/*.ts');
+            const automaton = buildAutomaton(pattern);
+            expect(isEmpty(automaton)).toBe(false);
+        });
+        it('returns false for alternation pattern', () => {
+            const pattern = parsePattern('{src,lib}/*.ts');
+            const automaton = buildAutomaton(pattern);
+            expect(isEmpty(automaton)).toBe(false);
+        });
+    });
+    describe('empty automata', () => {
+        // Note: isEmpty uses graph reachability, not semantic emptiness.
+        // For automata with wildcard transitions, the intersection may have
+        // reachable accepting states even if the language is semantically empty.
+        // Full semantic emptiness would require checking satisfiability of
+        // intersected wildcard patterns, which is beyond current implementation.
+        it('returns true for automaton with no accepting states', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            // Create an automaton with no accepting states
+            const emptyAutomaton = {
+                ...automaton,
+                acceptingStates: [],
+                states: automaton.states.map((s) => ({ ...s, accepting: false })),
+            };
+            expect(isEmpty(emptyAutomaton)).toBe(true);
+        });
+        it('returns true for automaton with unreachable accepting state', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            // Remove all transitions from initial state to make accepting states unreachable
+            const disconnectedAutomaton = {
+                ...automaton,
+                states: automaton.states.map((s, i) => (i === automaton.initialState ? { ...s, transitions: [] } : s)),
+            };
+            expect(isEmpty(disconnectedAutomaton)).toBe(true);
+        });
+    });
+});
+describe('findWitness', () => {
+    describe('finding witnesses', () => {
+        it('returns a matching path for simple pattern', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            const witness = findWitness(automaton);
+            expect(witness).toBeDefined();
+            expect(witness).toContain('src');
+            expect(witness).toContain('index.ts');
+        });
+        it('returns a matching path for wildcard pattern', () => {
+            const pattern = parsePattern('*.ts');
+            const automaton = buildAutomaton(pattern);
+            const witness = findWitness(automaton);
+            expect(witness).toBeDefined();
+            expect(witness).toMatch(/\.ts$/);
+        });
+        it('returns a matching path for globstar pattern', () => {
+            const pattern = parsePattern('src/**/*.ts');
+            const automaton = buildAutomaton(pattern);
+            const witness = findWitness(automaton);
+            expect(witness).toBeDefined();
+            expect(witness).toMatch(/^\/src\//);
+            expect(witness).toMatch(/\.ts$/);
+        });
+        it('returns undefined for automaton with no accepting states', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            // Create an automaton with no accepting states
+            const emptyAutomaton = {
+                ...automaton,
+                acceptingStates: [],
+                states: automaton.states.map((s) => ({ ...s, accepting: false })),
+            };
+            const witness = findWitness(emptyAutomaton);
+            expect(witness).toBeUndefined();
+        });
+    });
+    describe('witness validity', () => {
+        it('witness actually matches the pattern', () => {
+            const compiled = compilePattern(parsePattern('src/**/*.ts'));
+            const witness = findWitness(compiled.automaton);
+            expect(witness).toBeDefined();
+            // The witness is already a path string, verify it matches
+            expect(matchPath(witness, compiled)).toBe(true);
+        });
+    });
+});
+describe('countPaths', () => {
+    describe('bounded patterns', () => {
+        it('returns correct count for single literal', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            const counts = countPaths(automaton, 5);
+            // Exactly one path of length 2
+            expect(counts.get(2)).toBe(1);
+        });
+        it('returns counts for multiple depths', () => {
+            const pattern = parsePattern('src/*.ts');
+            const automaton = buildAutomaton(pattern);
+            const counts = countPaths(automaton, 5);
+            // Should have paths at depth 2
+            expect(counts.get(2)).toBeGreaterThanOrEqual(1);
+        });
+    });
+    describe('unbounded patterns', () => {
+        it('returns counts up to maxDepth for globstar', () => {
+            const pattern = parsePattern('src/**');
+            const automaton = buildAutomaton(pattern);
+            const counts = countPaths(automaton, 5);
+            // Should have paths at depths 1, 2, 3, 4, 5
+            expect(counts.get(1)).toBeGreaterThanOrEqual(1);
+            expect(counts.get(2)).toBeGreaterThanOrEqual(1);
+        });
+    });
+    describe('empty patterns', () => {
+        it('returns zero paths for automaton with no accepting states', () => {
+            const pattern = parsePattern('src/index.ts');
+            const automaton = buildAutomaton(pattern);
+            // Create an automaton with no accepting states
+            const emptyAutomaton = {
+                ...automaton,
+                acceptingStates: [],
+                states: automaton.states.map((s) => ({ ...s, accepting: false })),
+            };
+            const counts = countPaths(emptyAutomaton, 5);
+            // All counts should be 0 or map should be empty
+            let total = 0;
+            for (const count of counts.values()) {
+                total += count;
+            }
+            expect(total).toBe(0);
+        });
+    });
+});
+//# sourceMappingURL=emptiness.test.js.map

package/dist/automaton/emptiness.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"emptiness.test.js","sourceRoot":"","sources":["../../src/automaton/emptiness.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC9D,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAA;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAA;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAA;AAEpC,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACvB,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAA;YACpC,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,SAAS,CAAC,CAAA;YACvC,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC/C,MAAM,OAAO,GAAG,YAAY,CAAC,gBAAgB,CAAC,CAAA;YAC9C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,iEAAiE;QACjE,oEAAoE;QACpE,yEAAyE;QACzE,mEAAmE;QACnE,yEAAyE;QAEzE,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC7D,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,+CAA+C;YAC/C,MAAM,cAAc,GAAG;gBACrB,GAAG,SAAS;gBACZ,eAAe,EAAE,EAAE;gBACnB,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;aAClE,CAAA;YAED,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC5C,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACrE,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,iFAAiF;YACjF,MAAM,qBAAqB,GAAG;gBAC5B,GAAG,SAAS;gBACZ,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACvG,CAAA;YAED,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACnD,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAA;YAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;YAC7B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;YAChC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAA;QACvC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACtD,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAA;YACpC,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAA;YAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;YAC7B,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QAClC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACtD,MAAM,OAAO,GAAG,YAAY,CAAC,aAAa,CAAC,CAAA;YAC3C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAA;YAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;YAC7B,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;YACnC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QAClC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;YAClE,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,+CAA+C;YAC/C,MAAM,cAAc,GAAG;gBACrB,GAAG,SAAS;gBACZ,eAAe,EAAE,EAAE;gBACnB,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;aAClE,CAAA;YAED,MAAM,OAAO,GAAG,WAAW,CAAC,cAAc,CAAC,CAAA;YAE3C,MAAM,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,CAAA;QACjC,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,MAAM,QAAQ,GAAG,cAAc,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAA;YAC5D,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;YAE/C,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;YAE7B,0DAA0D;YAC1D,MAAM,CAAC,SAAS,CAAC,OAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClD,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAClD,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;YAEvC,+BAA+B;YAC/B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC/B,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,UAAU,CAAC,CAAA;YACxC,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;YAEvC,+BAA+B;YAC/B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAA;QACjD,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;YACtC,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;YAEvC,4CAA4C;YAC5C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAA;YAC/C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAA;QACjD,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACnE,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;YAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;YAEzC,+CAA+C;YAC/C,MAAM,cAAc,GAAG;gBACrB,GAAG,SAAS;gBACZ,eAAe,EAAE,EAAE;gBACnB,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;aAClE,CAAA;YAED,MAAM,MAAM,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC,CAAA;YAE5C,gDAAgD;YAChD,IAAI,KAAK,GAAG,CAAC,CAAA;YACb,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;gBACpC,KAAK,IAAI,KAAK,CAAA;YAChB,CAAC;YACD,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACvB,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/automaton/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Automaton operations for pattern containment checking.
+ * @packageDocumentation
+ */
+export { determinize, DEFAULT_MAX_DFA_STATES, type DeterminizeOptions } from './determinize';
+export { complement } from './complement';
+export { intersect, union } from './intersect';
+export { isEmpty, findWitness, countPaths } from './emptiness';
+export { patternIntersect, patternUnion, patternComplement, patternDifference } from './pattern-algebra';
+//# sourceMappingURL=index.d.ts.map

package/dist/automaton/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/automaton/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,sBAAsB,EAAE,KAAK,kBAAkB,EAAE,MAAM,eAAe,CAAA;AAC5F,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAG9D,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA"}

package/dist/automaton/index.js

@@ -0,0 +1,11 @@
+/**
+ * Automaton operations for pattern containment checking.
+ * @packageDocumentation
+ */
+export { determinize, DEFAULT_MAX_DFA_STATES } from './determinize';
+export { complement } from './complement';
+export { intersect, union } from './intersect';
+export { isEmpty, findWitness, countPaths } from './emptiness';
+// Pattern-level set operations
+export { patternIntersect, patternUnion, patternComplement, patternDifference } from './pattern-algebra';
+//# sourceMappingURL=index.js.map

package/dist/automaton/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/automaton/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,sBAAsB,EAA2B,MAAM,eAAe,CAAA;AAC5F,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE9D,+BAA+B;AAC/B,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA"}

package/dist/automaton/intersect.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Automaton intersection using product construction.
+ * @packageDocumentation
+ */
+import type { SegmentAutomaton } from '../types';
+/**
+ * Compute the intersection of two automata using product construction.
+ *
+ * The resulting automaton accepts a string iff both input automata accept it.
+ * L(A ∩ B) = L(A) ∩ L(B)
+ *
+ * @param a - First automaton
+ * @param b - Second automaton
+ * @returns Intersection automaton
+ *
+ * @public
+ */
+export declare function intersect(a: SegmentAutomaton, b: SegmentAutomaton): SegmentAutomaton;
+/**
+ * Compute the union of two automata using NFA construction.
+ *
+ * The resulting automaton accepts a string iff either input automaton accepts it.
+ * L(A ∪ B) = L(A) ∪ L(B)
+ *
+ * We use NFA union: create a new initial state with epsilon transitions
+ * to both automata's initial states, then merge the states.
+ *
+ * @param a - First automaton
+ * @param b - Second automaton
+ * @returns Union automaton (NFA)
+ *
+ * @public
+ */
+export declare function union(a: SegmentAutomaton, b: SegmentAutomaton): SegmentAutomaton;
+//# sourceMappingURL=intersect.d.ts.map

package/dist/automaton/intersect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersect.d.ts","sourceRoot":"","sources":["../../src/automaton/intersect.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAuD,MAAM,UAAU,CAAA;AAErG;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,GAAG,gBAAgB,CAEpF;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,GAAG,gBAAgB,CAyChF"}