@stevenvo780/st-lang 4.9.0 → 4.11.0

package/dist/reasoning/automata/pda.js

@@ -0,0 +1,169 @@
+"use strict";
+// ============================================================
+// ST Automata — PDA (Pushdown Automaton)
+// ============================================================
+//
+// Aceptación por estado final, con simulación no determinista.
+//
+// Una configuración es (state, posición de entrada, pila como string).
+// Se exploran con BFS pero con memoización de configuraciones vistas
+// para evitar bucles ε. Si la búsqueda explota, `maxDepth` corta.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pdaAccepts = pdaAccepts;
+exports.pdaPalindromes = pdaPalindromes;
+exports.pdaBalancedParens = pdaBalancedParens;
+const types_1 = require("./types");
+const configKey = (c) => `${c.state}|${c.pos}|${c.stack}`;
+/** ¿`M` acepta `input`?
+ *  `maxSteps` cota el número de configuraciones expandidas. */
+function pdaAccepts(M, input, maxSteps = 100_000) {
+    const start = {
+        state: M.initial,
+        pos: 0,
+        stack: M.initialStack,
+    };
+    const queue = [start];
+    const seen = new Set([configKey(start)]);
+    let steps = 0;
+    while (queue.length > 0) {
+        if (steps++ > maxSteps)
+            return false;
+        const cfg = queue.shift();
+        if (!cfg)
+            break;
+        // Aceptación por estado final con input consumido.
+        if (cfg.pos === input.length && M.accept.has(cfg.state))
+            return true;
+        const top = cfg.stack.length > 0 ? cfg.stack[cfg.stack.length - 1] : undefined;
+        for (const t of M.transitions) {
+            if (t.state !== cfg.state)
+                continue;
+            // Symbol de entrada.
+            if (t.read !== types_1.EPSILON) {
+                if (cfg.pos >= input.length)
+                    continue;
+                if (input[cfg.pos] !== t.read)
+                    continue;
+            }
+            // Pop.
+            if (t.popTop !== types_1.EPSILON) {
+                if (top === undefined)
+                    continue;
+                if (top !== t.popTop)
+                    continue;
+            }
+            const newStack = t.popTop !== types_1.EPSILON ? cfg.stack.slice(0, -1) : cfg.stack;
+            // pushTop: el último elemento queda en la cima → simplemente
+            // concatenar la string en orden.
+            const pushed = t.pushTop.join('');
+            const finalStack = newStack + pushed;
+            const newPos = t.read !== types_1.EPSILON ? cfg.pos + 1 : cfg.pos;
+            const next = {
+                state: t.nextState,
+                pos: newPos,
+                stack: finalStack,
+            };
+            const key = configKey(next);
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            queue.push(next);
+        }
+    }
+    return false;
+}
+// ── Lenguajes estándar libres de contexto ────────────────────
+/** PDA que acepta palíndromes pares e impares sobre {a, b} usando un
+ *  marcador no determinista (transición ε al "espejo"). */
+function pdaPalindromes(alphabet = ['a', 'b']) {
+    const Z = '$';
+    // Estados:
+    //   q0: empujando la primera mitad.
+    //   q1: comparando contra la segunda mitad.
+    //   q2: accept.
+    const states = new Set(['q0', 'q1', 'q2']);
+    const stackAlphabet = new Set([Z, ...alphabet]);
+    const alpha = new Set(alphabet);
+    const transitions = [];
+    // q0 → q0, leer x, push x  (apilar)
+    for (const x of alphabet) {
+        transitions.push({
+            state: 'q0',
+            read: x,
+            popTop: types_1.EPSILON,
+            nextState: 'q0',
+            pushTop: [x],
+        });
+    }
+    // q0 → q1, ε, ε, []  (cambio al modo comparar, palíndrome par)
+    transitions.push({
+        state: 'q0',
+        read: types_1.EPSILON,
+        popTop: types_1.EPSILON,
+        nextState: 'q1',
+        pushTop: [],
+    });
+    // q0 → q1, leer x, ε, []  (skip carácter central, palíndrome impar)
+    for (const x of alphabet) {
+        transitions.push({
+            state: 'q0',
+            read: x,
+            popTop: types_1.EPSILON,
+            nextState: 'q1',
+            pushTop: [],
+        });
+    }
+    // q1 → q1, leer x, pop x, []  (matchear segunda mitad)
+    for (const x of alphabet) {
+        transitions.push({
+            state: 'q1',
+            read: x,
+            popTop: x,
+            nextState: 'q1',
+            pushTop: [],
+        });
+    }
+    // q1 → q2, ε, pop Z, [Z]  (stack vuelve a $)
+    transitions.push({
+        state: 'q1',
+        read: types_1.EPSILON,
+        popTop: Z,
+        nextState: 'q2',
+        pushTop: [Z],
+    });
+    return {
+        states,
+        alphabet: alpha,
+        stackAlphabet,
+        transitions,
+        initial: 'q0',
+        initialStack: Z,
+        accept: new Set(['q2']),
+    };
+}
+/** PDA que acepta paréntesis balanceados (alfabeto '(' ')'). */
+function pdaBalancedParens() {
+    const Z = '$';
+    const states = new Set(['q0', 'q1']);
+    const alpha = new Set(['(', ')']);
+    const stackAlphabet = new Set([Z, '(']);
+    const transitions = [
+        // Abrir paréntesis: push '('.
+        { state: 'q0', read: '(', popTop: types_1.EPSILON, nextState: 'q0', pushTop: ['('] },
+        // Cerrar paréntesis: pop '('.
+        { state: 'q0', read: ')', popTop: '(', nextState: 'q0', pushTop: [] },
+        // Aceptar al ver $ en la cima (todo balanceado) — sin tocar pila.
+        { state: 'q0', read: types_1.EPSILON, popTop: Z, nextState: 'q1', pushTop: [Z] },
+    ];
+    return {
+        states,
+        alphabet: alpha,
+        stackAlphabet,
+        transitions,
+        initial: 'q0',
+        initialStack: Z,
+        accept: new Set(['q1']),
+    };
+}
+//# sourceMappingURL=pda.js.map

package/dist/reasoning/automata/pda.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pda.js","sourceRoot":"","sources":["../../../src/reasoning/automata/pda.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yCAAyC;AACzC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,EAAE;AACF,uEAAuE;AACvE,qEAAqE;AACrE,kEAAkE;AAClE,+DAA+D;;AAe/D,gCAmDC;AAMD,wCAmEC;AAGD,8CAsBC;AAjKD,mCAAkC;AAQlC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AAE1E;+DAC+D;AAC/D,SAAgB,UAAU,CAAC,CAAM,EAAE,KAAa,EAAE,QAAQ,GAAG,OAAO;IAClE,MAAM,KAAK,GAAW;QACpB,KAAK,EAAE,CAAC,CAAC,OAAO;QAChB,GAAG,EAAE,CAAC;QACN,KAAK,EAAE,CAAC,CAAC,YAAY;KACtB,CAAC;IACF,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,KAAK,EAAE,GAAG,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG;YAAE,MAAM;QAEhB,mDAAmD;QACnD,IAAI,GAAG,CAAC,GAAG,KAAK,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAErE,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAC9B,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;gBAAE,SAAS;YACpC,qBAAqB;YACrB,IAAI,CAAC,CAAC,IAAI,KAAK,eAAO,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,MAAM;oBAAE,SAAS;gBACtC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI;oBAAE,SAAS;YAC1C,CAAC;YACD,OAAO;YACP,IAAI,CAAC,CAAC,MAAM,KAAK,eAAO,EAAE,CAAC;gBACzB,IAAI,GAAG,KAAK,SAAS;oBAAE,SAAS;gBAChC,IAAI,GAAG,KAAK,CAAC,CAAC,MAAM;oBAAE,SAAS;YACjC,CAAC;YAED,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,KAAK,eAAO,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;YAC3E,6DAA6D;YAC7D,iCAAiC;YACjC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,MAAM,UAAU,GAAG,QAAQ,GAAG,MAAM,CAAC;YACrC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,eAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAC1D,MAAM,IAAI,GAAW;gBACnB,KAAK,EAAE,CAAC,CAAC,SAAS;gBAClB,GAAG,EAAE,MAAM;gBACX,KAAK,EAAE,UAAU;aAClB,CAAC;YACF,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gEAAgE;AAEhE;2DAC2D;AAC3D,SAAgB,cAAc,CAAC,WAAkC,CAAC,GAAG,EAAE,GAAG,CAAC;IACzE,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,WAAW;IACX,oCAAoC;IACpC,4CAA4C;IAC5C,gBAAgB;IAChB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACnD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;IACxC,MAAM,WAAW,GAAoB,EAAE,CAAC;IAExC,oCAAoC;IACpC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC;YACf,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,eAAO;YACf,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,CAAC,CAAC,CAAC;SACb,CAAC,CAAC;IACL,CAAC;IACD,+DAA+D;IAC/D,WAAW,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,eAAO;QACb,MAAM,EAAE,eAAO;QACf,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,EAAE;KACZ,CAAC,CAAC;IACH,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC;YACf,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,eAAO;YACf,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;IACL,CAAC;IACD,uDAAuD;IACvD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC;YACf,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,CAAC;YACT,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;IACL,CAAC;IACD,6CAA6C;IAC7C,WAAW,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,eAAO;QACb,MAAM,EAAE,CAAC;QACT,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,CAAC,CAAC,CAAC;KACb,CAAC,CAAC;IAEH,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,KAAK;QACf,aAAa;QACb,WAAW;QACX,OAAO,EAAE,IAAI;QACb,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;KACxB,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAgB,iBAAiB;IAC/B,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAChD,MAAM,WAAW,GAAuB;QACtC,8BAA8B;QAC9B,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,eAAO,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE;QAC5E,8BAA8B;QAC9B,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE;QACrE,kEAAkE;QAClE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE;KACzE,CAAC;IACF,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,KAAK;QACf,aAAa;QACb,WAAW;QACX,OAAO,EAAE,IAAI;QACb,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;KACxB,CAAC;AACJ,CAAC"}

package/dist/reasoning/automata/regex.d.ts

@@ -0,0 +1,6 @@
+import type { NFA, Regex } from './types';
+export declare function parseRegex(s: string): Regex;
+export declare function regexToNfa(r: Regex): NFA;
+/** Atajo: ¿la expresión regular `r` matchea exactamente `s`? */
+export declare function regexMatches(r: Regex, s: string): boolean;
+//# sourceMappingURL=regex.d.ts.map

package/dist/reasoning/automata/regex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/regex.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAU,MAAM,SAAS,CAAC;AA+FlD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAO3C;AAoHD,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAwCxC;AAED,gEAAgE;AAChE,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAGzD"}

package/dist/reasoning/automata/regex.js

@@ -0,0 +1,259 @@
+"use strict";
+// ============================================================
+// ST Automata — Regex parsing + Thompson construction
+// ============================================================
+//
+// Gramática soportada (precedencia: postfix > concat > '|'):
+//
+//   expr   := term ( '|' term )*
+//   term   := factor*                (concatenación implícita)
+//   factor := atom ( '*' | '+' | '?' )*
+//   atom   := char | '(' expr ')' | '∅' (vacío) | 'ε'
+//
+// Caracteres reservados: ( ) | * + ?  → escapar con '\'.
+// '∅' y 'ε' son atómicos opcionales (no son obligatorios para parsear).
+//
+// `regexToNfa` construye un NFA por la construcción de Thompson:
+// para cada operador un fragmento con un único initial y un único accept.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseRegex = parseRegex;
+exports.regexToNfa = regexToNfa;
+exports.regexMatches = regexMatches;
+const types_1 = require("./types");
+const nfa_1 = require("./nfa");
+function peek(c) {
+    return c.i < c.s.length ? c.s[c.i] : undefined;
+}
+function consume(c) {
+    const ch = peek(c);
+    if (ch !== undefined)
+        c.i++;
+    return ch;
+}
+function expect(c, ch) {
+    const got = consume(c);
+    if (got !== ch)
+        throw new Error(`parseRegex: esperaba "${ch}" en pos ${c.i - 1}, vi "${got ?? 'EOF'}"`);
+}
+const POSTFIX = new Set(['*', '+', '?']);
+const SPECIAL = new Set(['(', ')', '|', '*', '+', '?', '\\']);
+function parseExpr(c) {
+    let left = parseTerm(c);
+    while (peek(c) === '|') {
+        consume(c);
+        const right = parseTerm(c);
+        left = { kind: 'union', left, right };
+    }
+    return left;
+}
+function parseTerm(c) {
+    // term puede ser vacío → ε.
+    const atoms = [];
+    while (true) {
+        const ch = peek(c);
+        if (ch === undefined || ch === '|' || ch === ')')
+            break;
+        atoms.push(parseFactor(c));
+    }
+    if (atoms.length === 0)
+        return { kind: 'epsilon' };
+    return atoms.reduce((acc, r) => ({ kind: 'concat', left: acc, right: r }));
+}
+function parseFactor(c) {
+    let atom = parseAtom(c);
+    while (true) {
+        const ch = peek(c);
+        if (ch === undefined || !POSTFIX.has(ch))
+            break;
+        consume(c);
+        if (ch === '*')
+            atom = { kind: 'star', arg: atom };
+        else if (ch === '+')
+            atom = { kind: 'plus', arg: atom };
+        else if (ch === '?')
+            atom = { kind: 'optional', arg: atom };
+    }
+    return atom;
+}
+function parseAtom(c) {
+    const ch = peek(c);
+    if (ch === undefined)
+        throw new Error('parseRegex: EOF inesperado en atom');
+    if (ch === '(') {
+        consume(c);
+        const inner = parseExpr(c);
+        expect(c, ')');
+        return inner;
+    }
+    if (ch === '\\') {
+        consume(c);
+        const esc = consume(c);
+        if (esc === undefined)
+            throw new Error('parseRegex: escape colgante');
+        return { kind: 'char', c: esc };
+    }
+    if (ch === '∅') {
+        consume(c);
+        return { kind: 'empty' };
+    }
+    if (ch === 'ε') {
+        consume(c);
+        return { kind: 'epsilon' };
+    }
+    if (SPECIAL.has(ch)) {
+        throw new Error(`parseRegex: caracter "${ch}" reservado en pos ${c.i}`);
+    }
+    consume(c);
+    return { kind: 'char', c: ch };
+}
+function parseRegex(s) {
+    const c = { s, i: 0 };
+    const r = parseExpr(c);
+    if (c.i !== s.length) {
+        throw new Error(`parseRegex: tokens restantes en pos ${c.i}: "${s.slice(c.i)}"`);
+    }
+    return r;
+}
+function emptyFragment(initial, accept) {
+    return { initial, accept, edges: new Map(), alphabet: new Set() };
+}
+function addEdge(frag, from, sym, to) {
+    let row = frag.edges.get(from);
+    if (!row) {
+        row = new Map();
+        frag.edges.set(from, row);
+    }
+    let set = row.get(sym);
+    if (!set) {
+        set = new Set();
+        row.set(sym, set);
+    }
+    set.add(to);
+    if (sym !== types_1.EPSILON)
+        frag.alphabet.add(sym);
+}
+function mergeEdges(into, other) {
+    for (const [from, row] of other.edges) {
+        for (const [sym, set] of row) {
+            for (const to of set)
+                addEdge(into, from, sym, to);
+        }
+    }
+    for (const a of other.alphabet)
+        into.alphabet.add(a);
+}
+function buildFragment(r, fresh) {
+    if (r.kind === 'epsilon') {
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        addEdge(frag, init, types_1.EPSILON, acc);
+        return frag;
+    }
+    if (r.kind === 'empty') {
+        // Lenguaje vacío: dos estados sin conexión. No hay camino al accept.
+        const init = fresh();
+        const acc = fresh();
+        return emptyFragment(init, acc);
+    }
+    if (r.kind === 'char') {
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        addEdge(frag, init, r.c, acc);
+        return frag;
+    }
+    if (r.kind === 'concat') {
+        const A = buildFragment(r.left, fresh);
+        const B = buildFragment(r.right, fresh);
+        const frag = emptyFragment(A.initial, B.accept);
+        mergeEdges(frag, A);
+        mergeEdges(frag, B);
+        addEdge(frag, A.accept, types_1.EPSILON, B.initial);
+        return frag;
+    }
+    if (r.kind === 'union') {
+        const A = buildFragment(r.left, fresh);
+        const B = buildFragment(r.right, fresh);
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        mergeEdges(frag, A);
+        mergeEdges(frag, B);
+        addEdge(frag, init, types_1.EPSILON, A.initial);
+        addEdge(frag, init, types_1.EPSILON, B.initial);
+        addEdge(frag, A.accept, types_1.EPSILON, acc);
+        addEdge(frag, B.accept, types_1.EPSILON, acc);
+        return frag;
+    }
+    if (r.kind === 'star') {
+        const A = buildFragment(r.arg, fresh);
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        mergeEdges(frag, A);
+        addEdge(frag, init, types_1.EPSILON, A.initial);
+        addEdge(frag, init, types_1.EPSILON, acc);
+        addEdge(frag, A.accept, types_1.EPSILON, A.initial);
+        addEdge(frag, A.accept, types_1.EPSILON, acc);
+        return frag;
+    }
+    if (r.kind === 'plus') {
+        // a+ = a · a*
+        return buildFragment({ kind: 'concat', left: r.arg, right: { kind: 'star', arg: r.arg } }, fresh);
+    }
+    if (r.kind === 'optional') {
+        // a? = a | ε
+        return buildFragment({ kind: 'union', left: r.arg, right: { kind: 'epsilon' } }, fresh);
+    }
+    // Exhaustivo.
+    const _exhaustive = r;
+    return _exhaustive;
+}
+function regexToNfa(r) {
+    let counter = 0;
+    const fresh = () => counter++;
+    const frag = buildFragment(r, fresh);
+    // Convertir entero → string para encajar con NFA.
+    const stateName = (n) => `s${n}`;
+    const states = new Set();
+    const transitions = new Map();
+    // Asegurar que todos los estados conocidos estén poblados, incluso los
+    // que sólo aparecen como destino.
+    const seen = new Set();
+    for (const [from, row] of frag.edges) {
+        seen.add(from);
+        for (const set of row.values())
+            for (const to of set)
+                seen.add(to);
+    }
+    seen.add(frag.initial);
+    seen.add(frag.accept);
+    for (const n of seen)
+        states.add(stateName(n));
+    for (const [from, row] of frag.edges) {
+        const newRow = new Map();
+        for (const [sym, set] of row) {
+            const newSet = new Set();
+            for (const to of set)
+                newSet.add(stateName(to));
+            newRow.set(sym, newSet);
+        }
+        transitions.set(stateName(from), newRow);
+    }
+    return {
+        states,
+        alphabet: frag.alphabet,
+        transitions,
+        initial: stateName(frag.initial),
+        accept: new Set([stateName(frag.accept)]),
+        epsilon: types_1.EPSILON,
+    };
+}
+/** Atajo: ¿la expresión regular `r` matchea exactamente `s`? */
+function regexMatches(r, s) {
+    const nfa = regexToNfa(r);
+    return (0, nfa_1.nfaAccepts)(nfa, s);
+}
+//# sourceMappingURL=regex.js.map

package/dist/reasoning/automata/regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","sourceRoot":"","sources":["../../../src/reasoning/automata/regex.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,EAAE;AACF,iCAAiC;AACjC,+DAA+D;AAC/D,wCAAwC;AACxC,sDAAsD;AACtD,EAAE;AACF,yDAAyD;AACzD,wEAAwE;AACxE,EAAE;AACF,iEAAiE;AACjE,0EAA0E;AAC1E,+DAA+D;;AAiG/D,gCAOC;AAoHD,gCAwCC;AAGD,oCAGC;AAvQD,mCAAkC;AAClC,+BAAmC;AASnC,SAAS,IAAI,CAAC,CAAS;IACrB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACjD,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,KAAK,SAAS;QAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,EAAU;IACnC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,GAAG,KAAK,EAAE;QACZ,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC;AAC5F,CAAC;AAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;AAE9D,SAAS,SAAS,CAAC,CAAS;IAC1B,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IAC1B,4BAA4B;IAC5B,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,MAAM;QACxD,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACnD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,WAAW,CAAC,CAAS;IAC5B,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,MAAM;QAChD,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;aAC9C,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;aACnD,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC5E,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACf,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,GAAG,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACtE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;IAClC,CAAC;IACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC3B,CAAC;IACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAC7B,CAAC;IACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,CAAC,CAAC,CAAC,CAAC;IACX,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;AACjC,CAAC;AAED,SAAgB,UAAU,CAAC,CAAS;IAClC,MAAM,CAAC,GAAW,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAgBD,SAAS,aAAa,CAAC,OAAe,EAAE,MAAc;IACpD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AACpE,CAAC;AAED,SAAS,OAAO,CAAC,IAAc,EAAE,IAAY,EAAE,GAAW,EAAE,EAAU;IACpE,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACZ,IAAI,GAAG,KAAK,eAAO;QAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,UAAU,CAAC,IAAc,EAAE,KAAe;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC;YAC7B,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,aAAa,CAAC,CAAQ,EAAE,KAAmB;IAClD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACvB,qEAAqE;QACrE,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAChD,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QAClC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5C,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,cAAc;QACd,OAAO,aAAa,CAClB,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,EACpE,KAAK,CACN,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC1B,aAAa;QACb,OAAO,aAAa,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IAC1F,CAAC;IACD,cAAc;IACd,MAAM,WAAW,GAAU,CAAC,CAAC;IAC7B,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAgB,UAAU,CAAC,CAAQ;IACjC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAG,GAAW,EAAE,CAAC,OAAO,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAErC,kDAAkD;IAClD,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoC,CAAC;IAEhE,uEAAuE;IACvE,kCAAkC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEtB,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,WAAW;QACX,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC;QAChC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACzC,OAAO,EAAE,eAAO;KACjB,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAgB,YAAY,CAAC,CAAQ,EAAE,CAAS;IAC9C,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC"}

package/dist/reasoning/automata/types.d.ts

@@ -0,0 +1,69 @@
+export declare const EPSILON: "\u03B5";
+export type Symbol = string;
+export interface DFA {
+    readonly states: Set<string>;
+    readonly alphabet: Set<Symbol>;
+    /** state → symbol → state. La función puede ser parcial: si falta una
+     *  arista para (state, symbol), la palabra es rechazada. */
+    readonly transitions: Map<string, Map<Symbol, string>>;
+    readonly initial: string;
+    readonly accept: Set<string>;
+}
+export interface NFA {
+    readonly states: Set<string>;
+    readonly alphabet: Set<Symbol>;
+    /** state → symbol (puede ser EPSILON) → P(states). */
+    readonly transitions: Map<string, Map<Symbol, Set<string>>>;
+    readonly initial: string;
+    readonly accept: Set<string>;
+    /** Símbolo usado como ε; default `EPSILON` ('ε'). */
+    readonly epsilon?: Symbol;
+}
+export type Regex = {
+    kind: 'empty';
+} | {
+    kind: 'epsilon';
+} | {
+    kind: 'char';
+    c: Symbol;
+} | {
+    kind: 'concat';
+    left: Regex;
+    right: Regex;
+} | {
+    kind: 'union';
+    left: Regex;
+    right: Regex;
+} | {
+    kind: 'star';
+    arg: Regex;
+} | {
+    kind: 'plus';
+    arg: Regex;
+} | {
+    kind: 'optional';
+    arg: Regex;
+};
+export interface PDATransition {
+    /** Estado origen. */
+    readonly state: string;
+    /** Símbolo de entrada a consumir; EPSILON = sin consumir. */
+    readonly read: Symbol;
+    /** Tope de pila a desapilar; EPSILON = sin pop. */
+    readonly popTop: Symbol;
+    /** Estado destino. */
+    readonly nextState: string;
+    /** Símbolos a apilar (el último queda en la cima). [] = no push. */
+    readonly pushTop: ReadonlyArray<Symbol>;
+}
+export interface PDA {
+    readonly states: Set<string>;
+    readonly alphabet: Set<Symbol>;
+    readonly stackAlphabet: Set<Symbol>;
+    readonly transitions: ReadonlyArray<PDATransition>;
+    readonly initial: string;
+    readonly initialStack: Symbol;
+    /** Aceptación por estado final. */
+    readonly accept: Set<string>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/reasoning/automata/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/types.ts"],"names":[],"mappings":"AAyBA,eAAO,MAAM,OAAO,EAAG,QAAY,CAAC;AAEpC,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAI5B,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B;gEAC4D;IAC5D,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC9B;AAID,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,sDAAsD;IACtD,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,qDAAqD;IACrD,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B;AAID,MAAM,MAAM,KAAK,GACb;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;IAAE,IAAI,EAAE,SAAS,CAAA;CAAE,GACnB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAC3B;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,KAAK,CAAA;CAAE,GAC5B;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,KAAK,CAAA;CAAE,GAC5B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,GAAG,EAAE,KAAK,CAAA;CAAE,CAAC;AAIrC,MAAM,WAAW,aAAa;IAC5B,qBAAqB;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,sBAAsB;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,oEAAoE;IACpE,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,aAAa,CAAC,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,mCAAmC;IACnC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC9B"}

package/dist/reasoning/automata/types.js

@@ -0,0 +1,29 @@
+"use strict";
+// ============================================================
+// ST Automata — Tipos
+// ============================================================
+//
+// Modelado clásico de autómatas finitos y de pila:
+//
+//   DFA (Deterministic Finite Automaton)
+//     · Transición total: state × symbol → state.
+//     · Acepta una palabra sii el camino termina en estado final.
+//
+//   NFA (Nondeterministic Finite Automaton, con ε-transiciones)
+//     · Transición: state × (symbol ∪ {ε}) → P(states).
+//     · Acepta sii existe un camino que termina en final.
+//
+//   PDA (Pushdown Automaton) — variante "by final state"
+//     · Transición: (state, read, popTop) → (nextState, pushTop[]).
+//     · `read` o `popTop` pueden ser ε (sin consumir / sin tope).
+//     · pushTop se apila en orden inverso (último → top).
+//
+// Notas:
+//   • Los símbolos son strings de longitud 1 (chars). El alfabeto
+//     se mantiene explícito porque define complement(M).
+//   • La constante EPSILON ('ε') vive aquí para reutilizarse.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EPSILON = void 0;
+exports.EPSILON = 'ε';
+//# sourceMappingURL=types.js.map

package/dist/reasoning/automata/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/reasoning/automata/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sBAAsB;AACtB,+DAA+D;AAC/D,EAAE;AACF,mDAAmD;AACnD,EAAE;AACF,yCAAyC;AACzC,kDAAkD;AAClD,kEAAkE;AAClE,EAAE;AACF,gEAAgE;AAChE,wDAAwD;AACxD,0DAA0D;AAC1D,EAAE;AACF,yDAAyD;AACzD,oEAAoE;AACpE,kEAAkE;AAClE,0DAA0D;AAC1D,EAAE;AACF,SAAS;AACT,kEAAkE;AAClE,yDAAyD;AACzD,8DAA8D;AAC9D,+DAA+D;;;AAElD,QAAA,OAAO,GAAG,GAAY,CAAC"}