fas-js 1.3.1 → 1.4.0

package/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/globals/errors.ts","../src/components/State.ts","../src/globals/globals.ts","../src/components/Alphabet.ts","../src/components/NFATransition.ts","../src/components/Transition.ts","../src/utils/DFAUtils.ts","../src/utils/NFAUtils.ts","../src/utils/FSAUtils.ts","../src/automata/DFA.ts","../src/automata/NFA.ts","../src/engine/Simulators.ts"],"sourcesContent":["export const ErrorCode: Readonly<Record<string, string>> = Object.freeze({\n  DUPLICATE_ALPHABET_VALS: \"E-001\",\n  DUPLICATE_STATE_NAMES: \"E-002\",\n  INVALID_STATE_NAME: \"E-003\",\n  START_STATE_NOT_FOUND: \"E-004\",\n  ACCEPTS_NOT_SUBSET: \"E-005\",\n  ORIGIN_STATE_NOT_FOUND: \"E-006\",\n  DEST_STATE_NOT_FOUND: \"E-007\",\n  MISSING_REQUIRED_TRANSITION: \"E-008\",\n  INVALID_INPUT_CHAR: \"E-009\",\n  INPUT_STATE_NOT_FOUND: \"E-010\",\n  INVALID_TRANSITION_OBJECT: \"E-011\",\n  DUPLICATE_TRANSITION_OBJECT: \"E-012\",\n  INVALID_STATE_ARRAY: \"E-013\"\n});","import { ErrorCode } from \"../globals/errors\";\n\nexport class State {\n  name: string;\n\n  constructor(name: string) {\n    this.name = name;\n    if (!this.name) throw new Error(ErrorCode.INVALID_STATE_NAME);\n  }\n}","import { State } from \"../components/State\";\n\n// Count number of instances for each string in an array - returns key/val pairs\nexport const count = (names: string[]): Record<string, number> =>\n  names.reduce((a, b) => Object.assign(a, { [b]: (a[b] || 0) + 1 }), {} as Record<string, number>);\n\n// Returns keys with value > 1\nexport const duplicates = (dict: Record<string, number>): string[] =>\n  Object.keys(dict).filter(a => dict[a] > 1);\n\n// Equality function for Arrays containing primitive typed values\nexport const compare = (\n  a1: Array<string | number | boolean>,\n  a2: Array<string | number | boolean>\n): boolean => {\n  const s1 = new Set(a1);\n  const s2 = new Set(a2);\n  return s1.size === s2.size && [...s1].every(v => s2.has(v));\n};\n\n// Check for duplicate keys in a Set<State> input\nexport const checkStateDuplicates = (states: Set<State>): boolean => {\n  const check: Set<string> = new Set();\n  for (const item of states) {\n    if (check.has(item.name)) return true;\n    check.add(item.name);\n  }\n  return false;\n};\n\nexport const getOrDefault = <K, V>(map: Map<K, V>, key: K, defaultValue: V): V => {\n  const val = map.get(key);\n  return val == null ? defaultValue : val;\n};\n\nexport const instanceOf = (ctor: Function, obj: object): boolean => {\n  return obj instanceof ctor || (Boolean(ctor.name) && ctor.name === obj.constructor.name);\n};\n\nexport const isSubsetOf = <T>(subset: Set<T>, superset: Set<T>): boolean => {\n  for (const item of subset) {\n    if (!superset.has(item)) return false;\n  }\n  return true;\n};\n\nexport const isSupersetOf = <T>(superset: Set<T>, subset: Set<T>): boolean => {\n  return isSubsetOf(subset, superset);\n};","import { ErrorCode } from \"../globals/errors\";\nimport { count, duplicates } from \"../globals/globals\";\n\nexport class Alphabet {\n  sigma: string[];\n\n  constructor(sigma: string | string[]) {\n    if (!Array.isArray(sigma)) {\n      if (typeof sigma === \"string\") sigma = [...sigma];\n      else throw new TypeError();\n    }\n    this.sigma = sigma;\n    if (duplicates(count(this.sigma)).length > 0) throw new Error(ErrorCode.DUPLICATE_ALPHABET_VALS);\n  }\n}","import { State } from \"./State\";\n\nexport class NFATransition {\n  origin: State;\n  dest: State[];\n  input: string;\n\n  constructor(origin: State, dest: State[], input: string) {\n    this.origin = origin;\n    this.dest = dest;\n    this.input = input;\n  }\n}","import { State } from \"./State\";\n\nexport class Transition {\n  origin: State;\n  dest: State;\n  input: string;\n\n  constructor(origin: State, dest: State, input: string) {\n    this.origin = origin;\n    this.dest = dest;\n    this.input = input;\n  }\n}","import { ErrorCode } from \"../globals/errors\";\nimport { State, Alphabet, Transition } from \"../components\";\nimport { DFA } from \"../automata\";\nimport { getOrDefault } from \"../globals/globals\";\n\nexport class DFAUtils {\n  /*\n   * Transition function should only contain states in Q, and one transition should exist\n   * for each combination of Q x Σ\n   */\n  static validateTFunc(\n    _states: Set<State>,\n    _paths: Map<State, Set<string>>,\n    _tfunc: Set<Transition>,\n    _alph: Alphabet\n  ): Set<Transition> {\n    const newTFunc: Set<Transition> = new Set(); // Will contain only necessary transitions\n\n    for (const _t of _tfunc) {\n      // Check for valid states\n      if (!_states.has(_t.origin)) {\n        console.error(\"Origin state was invalid: %o\", JSON.stringify(_t.origin));\n        throw new Error(ErrorCode.ORIGIN_STATE_NOT_FOUND);\n      }\n      if (!_states.has(_t.dest)) {\n        console.error(\"Dest state was invalid: %o\", JSON.stringify(_t.dest));\n        throw new Error(ErrorCode.DEST_STATE_NOT_FOUND);\n      }\n\n      const pathStateVals: Set<string> = getOrDefault(_paths, _t.origin, new Set());\n\n      // Map transition to a path and remove on match\n      if (this.isValidInputChar(_t.input, _alph)) {\n        if (_paths.has(_t.origin) && pathStateVals.has(_t.input)) {\n          newTFunc.add(_t);\n          pathStateVals.delete(_t.input);\n          if (pathStateVals.size === 0) {\n            _paths.delete(_t.origin);\n          }\n        } else {\n          throw new Error(ErrorCode.DUPLICATE_TRANSITION_OBJECT);\n        }\n      } else {\n        throw new Error(ErrorCode.INVALID_INPUT_CHAR);\n      }\n    }\n\n    if (_paths.size > 0) {\n      console.error(\"Not all FSA paths have a transition specified:\");\n      for (const [key, val] of _paths) {\n        console.error(\"State %s on input(s): %s\", key.name, [...val].join(\" \"));\n      }\n      throw new Error(ErrorCode.MISSING_REQUIRED_TRANSITION);\n    }\n\n    return newTFunc;\n  }\n\n  static createPaths(_states: Set<State>, _alph: Alphabet): Map<State, Set<string>> {\n    const _paths: Map<State, Set<string>> = new Map<State, Set<string>>();\n    for (const state of _states) {\n      for (const char of _alph.sigma) {\n        const pathStateVals: Set<string> = getOrDefault(_paths, state, new Set());\n        if (_paths.has(state)) pathStateVals.add(char);\n        else _paths.set(state, new Set([char]));\n      }\n    }\n\n    return _paths;\n  }\n\n  // Determine digraph order based on start state, then following the chain\n  static determineStateOrder(\n    _links: Map<string, Set<string>>,\n    _tfunc: Set<Transition>,\n    _states: Set<State>,\n    _start: State,\n    _accepts: Set<State>\n  ): string[] {\n    const statesOrder: string[] = []; // Ordered state names for digraph\n\n    // Map origin state names to dest state names\n    _links = new Map();\n    for (const tr of _tfunc) {\n      const linkStateVals: Set<string> = getOrDefault(_links, tr.origin.name, new Set());\n      if (_links.has(tr.origin.name)) linkStateVals.add(tr.dest.name);\n      else _links.set(tr.origin.name, new Set([tr.dest.name]));\n    }\n\n    // Populate state order\n    this.parseLinks(statesOrder, _start.name, _links);\n\n    // Check for dead states and reduce FSA if necessary\n    const stateArr: string[] = [];\n    (Object.values([..._states]) as State[]).map((state: State) => stateArr.push(state.name));\n    const deadStates = stateArr.filter(x => !statesOrder.includes(x));\n    if (deadStates.length > 0) {\n      console.warn(\"Dead states detected, removing them and associated transitions: %O\", deadStates);\n      this.removeDeadStates(deadStates, _states, _accepts, _tfunc);\n    }\n\n    return statesOrder;\n  }\n\n  // Reduce FSA by removing dead states and associated transitions\n  static removeDeadStates(\n    deadStates: string[],\n    _states: Set<State>,\n    _accepts: Set<State>,\n    _tfunc: Set<Transition>\n  ) {\n    // Q\n    for (const state of _states) {\n      if (deadStates.indexOf(state.name) !== -1) _states.delete(state);\n    }\n    // F\n    for (const state of _accepts) {\n      if (deadStates.indexOf(state.name) !== -1) _accepts.delete(state);\n    }\n    // δ\n    for (const tr of _tfunc) {\n      if (deadStates.indexOf(tr.origin.name) !== -1 || deadStates.indexOf(tr.dest.name) !== -1) _tfunc.delete(tr);\n    }\n  }\n\n  // Recursively parse graph while adding to an array in order, beginning with q0\n  static parseLinks(arr: string[], name: string, _links: Map<string, Set<string>>) {\n    arr.push(name);\n    const nameVal = getOrDefault(_links, name, new Set<string>());\n    for (const st of nameVal) {\n      if (arr.indexOf(st) === -1) this.parseLinks(arr, st, _links);\n    }\n  }\n\n  // DFA does not allow empty symbol\n  static isValidInputChar(input: string, _alph: Alphabet): boolean {\n    if (input === \"\") return false;\n    return _alph.sigma.indexOf(input) !== -1;\n  }\n}\n\nexport interface TransitionInput {\n  from: string;\n  to: string;\n  input: string;\n}\n\n// Global export method for creating DFA\nexport const createDFA = (\n  states: Map<string, State>,\n  alphabet: Alphabet,\n  transitions: TransitionInput[],\n  start: State,\n  accepts: Set<State>\n): InstanceType<typeof DFA> => {\n  // Convert transition array to Set<Transition>\n  const _tfunc: Set<Transition> = new Set();\n  for (const tr of transitions) {\n    if (!tr.from || !tr.to || !tr.input) throw new Error(ErrorCode.INVALID_TRANSITION_OBJECT);\n    const fromVal: State = getOrDefault(states, tr.from, null as unknown as State);\n    const toVal: State = getOrDefault(states, tr.to, null as unknown as State);\n    _tfunc.add(new Transition(fromVal, toVal, tr.input));\n  }\n  return new DFA(new Set(states.values()), alphabet, _tfunc, start, accepts);\n};","import { DFAUtils } from \"./DFAUtils\";\nimport { NFA } from \"../automata\";\nimport { State, Transition, Alphabet, NFATransition } from \"../components\";\nimport { ErrorCode } from \"../globals/errors\";\nimport { getOrDefault } from \"../globals/globals\";\nimport type { TransitionInput } from \"./DFAUtils\";\n\nexport class NFAUtils extends DFAUtils {\n  // NFA inheritly allows for ε (empty string) transition if specified\n  static isValidInputChar(input: string, _alph: Alphabet): boolean {\n    return _alph.sigma.indexOf(input) !== -1 || input === \"\";\n  }\n\n  // Follow all ε transitions and add to `state` (origin states)\n  static populateEpsilons(_tfunc: Set<Transition>, state: State[]): State[] {\n    let cont = true; // continue\n    while (cont) {\n      cont = false;\n\n      // Find all ε from origin set\n      const epsTransitions: Transition[] = Array.from(_tfunc).filter(obj => {\n        return state.includes(obj.origin) && obj.input === \"\";\n      });\n\n      // Add new states, break if no new states found\n      for (const _t of epsTransitions) {\n        if (!state.includes(_t.dest)) {\n          state.push(_t.dest);\n          cont = true;\n        }\n      }\n    }\n    return state;\n  }\n\n  // Validate tfunc according to NFA rules\n  static validateTFunc(\n    _states: Set<State>,\n    _paths: Map<State, Set<string>>,\n    _tfunc: Set<Transition>,\n    _alph: Alphabet\n  ): Set<Transition> {\n    const newTFunc: Set<Transition> = new Set(); // Will contain only necessary transitions\n\n    for (const _t of _tfunc) {\n      let skip = false;\n\n      // Check for valid states\n      if (!_states.has(_t.origin)) {\n        console.error(\"Origin state was invalid: %o\", JSON.stringify(_t.origin));\n        throw new Error(ErrorCode.ORIGIN_STATE_NOT_FOUND);\n      }\n      if (!_states.has(_t.dest)) {\n        console.error(\"Dest state was invalid: %o\", JSON.stringify(_t.dest));\n        throw new Error(ErrorCode.DEST_STATE_NOT_FOUND);\n      }\n\n      const pathStateVals: Set<string> = getOrDefault(_paths, _t.origin, new Set());\n\n      // Check for duplicate before adding\n      for (const _checkT of newTFunc) {\n        if (_checkT.origin === _t.origin && _checkT.dest === _t.dest && _checkT.input === _t.input) skip = true;\n      }\n\n      // Map transition to a path and remove on match\n      if (!skip) {\n        if (_paths.has(_t.origin)) {\n          if (this.isValidInputChar(_t.input, _alph)) {\n            newTFunc.add(_t);\n          } else {\n            throw new Error(ErrorCode.INVALID_INPUT_CHAR);\n          }\n        }\n      }\n    }\n\n    return newTFunc;\n  }\n}\n\nexport const createNFA = (\n  states: Map<string, State>,\n  alphabet: Alphabet,\n  transitions: TransitionInput[],\n  start: State,\n  accepts: Set<State>\n): InstanceType<typeof NFA> => {\n  // Convert transition array to Set<NFATransition>\n  const _tfunc: Set<NFATransition> = new Set();\n  for (const tr of transitions) {\n    if (!tr.from || !tr.to || (!tr.input && tr.input !== \"\"))\n      throw new Error(ErrorCode.INVALID_TRANSITION_OBJECT);\n    const fromVal: State = getOrDefault(states, tr.from, null as unknown as State);\n    const toVal: string[] = tr.to.split(\",\");\n\n    const destStates: State[] = [];\n    toVal.forEach(_dest => {\n      destStates.push(getOrDefault(states, _dest, null as unknown as State));\n    });\n\n    _tfunc.add(new NFATransition(fromVal, destStates, tr.input));\n  }\n  return new NFA(new Set(states.values()), alphabet, _tfunc, start, accepts);\n};","import { ErrorCode } from \"../globals/errors\";\nimport { instanceOf, getOrDefault } from \"../globals/globals\";\nimport { FSA } from \"../interfaces/FSA\";\nimport { State, Transition, Alphabet } from \"../components\";\nimport { DFA, NFA } from \"../automata\";\nimport { DFAUtils, createDFA, type TransitionInput } from \"./DFAUtils\";\nimport { NFAUtils, createNFA } from \"./NFAUtils\";\n\nexport type { TransitionInput };\n\n/*\n * This class will take an input FSA constructor function\n * to determine which util methods need to be called\n */\nexport const FSAUtils = (() => {\n  /*\n   * Private methods\n   */\n  function receiveInputDFA(dfa: InstanceType<typeof DFA>, input: string, state: State): State {\n    if (dfa.getAlphabet().sigma.indexOf(input) === -1) throw new Error(ErrorCode.INVALID_INPUT_CHAR);\n    if (!dfa.getStates().has(state)) throw new Error(ErrorCode.INPUT_STATE_NOT_FOUND);\n\n    const path = Array.from(dfa.getTFunc()).find(obj => {\n      return obj.origin === state && obj.input === input;\n    });\n\n    if (path) return path.dest;\n    else throw new Error(ErrorCode.INVALID_TRANSITION_OBJECT);\n  }\n\n  function receiveInputNFA(nfa: InstanceType<typeof NFA>, input: string, state: State[]): Set<State> {\n    let path: Transition[] = [];\n    if (nfa.getAlphabet().sigma.indexOf(input) === -1) throw new Error(ErrorCode.INVALID_INPUT_CHAR);\n\n    // Empty transitions\n    state = populateEpsilons(nfa.getTFunc(), state);\n\n    // For ε input, return states already determined\n    if (input === \"\") return new Set<State>(state);\n\n    // Looking at all origin states, based on input char, determine set of destination states\n    for (const _s of state) {\n      const _addToPath: Transition[] = Array.from(nfa.getTFunc()).filter(obj => {\n        return obj.origin === _s && obj.input === input;\n      });\n\n      path = path.concat(_addToPath);\n    }\n\n    let resultArr: State[] = [];\n    if (path.length > 1) {\n      for (const _s of path) resultArr.push(_s.dest);\n    } else if (path.length === 1) {\n      resultArr.push(path[0].dest);\n    } else {\n      // No valid transition found, returning empty set\n      return new Set<State>();\n    }\n\n    // Empty transitions on result set\n    const retSet: Set<State> = new Set<State>(populateEpsilons(nfa.getTFunc(), resultArr));\n\n    return retSet;\n  }\n\n  function populateEpsilons(_tfunc: Set<Transition>, state: State[]): State[] {\n    return NFAUtils.populateEpsilons(_tfunc, state);\n  }\n\n  class FSAUtils {\n    _type: typeof DFA | typeof NFA;\n\n    constructor(v: typeof DFA | typeof NFA) {\n      this._type = v;\n    }\n\n    receiveInput(fsa: FSA, input: string, state: State | State[]): State | Set<State> {\n      if (instanceOf(NFA, fsa)) {\n        if (state instanceof State) return receiveInputNFA(fsa as InstanceType<typeof NFA>, input, [state]);\n        else return receiveInputNFA(fsa as InstanceType<typeof NFA>, input, state);\n      } else {\n        if (Array.isArray(state)) {\n          if (state.length > 1) {\n            console.error(\"State array can only contain one state for DFAs\");\n            throw new Error(ErrorCode.INVALID_STATE_ARRAY);\n          } else {\n            state = state[0];\n          }\n        }\n        return receiveInputDFA(fsa as InstanceType<typeof DFA>, input, state);\n      }\n    }\n\n    validateTFunc(\n      _states: Set<State>,\n      _paths: Map<State, Set<string>>,\n      _tfunc: Set<Transition>,\n      _alph: Alphabet\n    ): Set<Transition> {\n      if (this._type === NFA) {\n        return NFAUtils.validateTFunc(_states, _paths, _tfunc, _alph);\n      } else {\n        return DFAUtils.validateTFunc(_states, _paths, _tfunc, _alph);\n      }\n    }\n\n    createPaths(_states: Set<State>, _alph: Alphabet): Map<State, Set<string>> {\n      return DFAUtils.createPaths(_states, _alph);\n    }\n\n    determineStateOrder(\n      _links: Map<string, Set<string>>,\n      _tfunc: Set<Transition>,\n      _states: Set<State>,\n      _start: State,\n      _accepts: Set<State>\n    ): string[] {\n      return DFAUtils.determineStateOrder(_links, _tfunc, _states, _start, _accepts);\n    }\n  }\n\n  return FSAUtils;\n})();\n\n// Global export method for creating FSA\nexport const createFSA = (\n  states: string | string[],\n  alphabet: string | string[],\n  transitions: TransitionInput | TransitionInput[],\n  start: string,\n  accepts: string | string[]\n): FSA => {\n  // Type check and conversion for states\n  const _states: Map<string, State> = new Map();\n  if (typeof states === \"string\") {\n    _states.set(states, new State(states));\n  } else if (Array.isArray(states)) {\n    for (const state of states) {\n      if (!_states.has(state)) _states.set(state, new State(state));\n    }\n  } else {\n    throw new TypeError(String(states));\n  }\n\n  // Convert remaining inputs\n  const _alphabet = new Alphabet(alphabet);\n  if (typeof start !== \"string\") throw new TypeError(String(start));\n  const _start: State = getOrDefault(_states, start, null as unknown as State);\n\n  const _accepts: Set<State> = new Set();\n  if (typeof accepts === \"string\") {\n    if (_states.has(accepts)) _accepts.add(getOrDefault(_states, accepts, null as unknown as State));\n  } else if (Array.isArray(accepts)) {\n    for (const state of accepts) {\n      _accepts.add(getOrDefault(_states, state, null as unknown as State));\n    }\n  } else {\n    throw new TypeError(String(accepts));\n  }\n\n  /*\n   * Determine, based on tfunc structure, whether to create a DFA or NFA\n   * If the \"to\" field of any member of the tfunc object is comma separated, or any input\n   * char is \"\", then create an NFA\n   */\n  let transitionList: TransitionInput[];\n  if (!Array.isArray(transitions) && typeof transitions === \"object\") transitionList = [transitions];\n  else if (Array.isArray(transitions)) transitionList = transitions;\n  else throw new TypeError(String(transitions));\n\n  for (const tr of transitionList) {\n    if (tr.to.indexOf(\",\") != -1 || tr.input === \"\")\n      return createNFA(_states, _alphabet, transitionList, _start, _accepts);\n  }\n  return createDFA(_states, _alphabet, transitionList, _start, _accepts);\n};","import { FSA } from \"../interfaces/FSA\";\nimport { State, Alphabet, Transition } from \"../components\";\nimport { ErrorCode } from \"../globals/errors\";\nimport { checkStateDuplicates, getOrDefault, isSubsetOf } from \"../globals/globals\";\nimport { FSAUtils } from \"../utils\";\n\nexport const DFA = (() => {\n  class DFA implements FSA {\n    // Primary FSA attributes\n    #states: Set<State>;\n    #alphabet: Alphabet;\n    #tfunc: Set<Transition>;\n    #start: State;\n    #accepts: Set<State>;\n\n    // Intermediary attributes used in constructor\n    #paths: Map<State, Set<string>>; // States mapped to each member of Σ, will be empty after constructor returns\n    #links: Map<string, Set<string>> = new Map(); // State names mapped to their dest state names\n    #utils: InstanceType<typeof FSAUtils>;\n\n    constructor(\n      states: Set<State>,\n      alphabet: Alphabet,\n      tfunc: Set<Transition>,\n      start: State,\n      accepts: Set<State> | Record<string, never>\n    ) {\n      // initialize utils\n      this.#utils = new FSAUtils(this.constructor as typeof DFA);\n\n      // states validations\n      if (checkStateDuplicates(states)) throw new Error(ErrorCode.DUPLICATE_STATE_NAMES);\n      this.#states = states;\n\n      this.#alphabet = alphabet;\n\n      // Create paths map\n      this.#paths = this.#utils.createPaths(this.#states, this.#alphabet);\n\n      // Start/Accept validations\n      if (!states.has(start)) throw new Error(ErrorCode.START_STATE_NOT_FOUND);\n      this.#start = start;\n      if (Object.keys(accepts).length === 0 && accepts.constructor === Object) accepts = new Set([]); // Allow for {}\n      if (!isSubsetOf(accepts as Set<State>, states)) throw new Error(ErrorCode.ACCEPTS_NOT_SUBSET);\n      this.#accepts = accepts as Set<State>;\n\n      // TFunc validations\n      this.#tfunc = this.#utils.validateTFunc(this.#states, this.#paths, tfunc, this.#alphabet);\n    }\n\n    /*\n     * Getters\n     */\n    getStates(): Set<State> {\n      return this.#states;\n    }\n    getAlphabet(): Alphabet {\n      return this.#alphabet;\n    }\n    getTFunc(): Set<Transition> {\n      return this.#tfunc;\n    }\n    getStartState(): State {\n      return this.#start;\n    }\n    getAcceptStates(): Set<State> {\n      return this.#accepts;\n    }\n    getType(): string {\n      return \"DFA\";\n    }\n\n    generateDigraph(): string {\n      // Prep outputs\n      const acceptArr: string[] = [];\n      for (const state of this.#accepts) acceptArr.push(state.name);\n\n      // Duplicate origin/dest combinations should share a line\n      const pairs: Map<string, string> = new Map();\n      (Object.values([...this.#tfunc]) as Transition[]).map(function (t: Transition) {\n        const key: string = t.origin.name + t.dest.name;\n        let _input: string = t.input;\n        if (_input === \"\") _input = \"ε\";\n        if (!pairs.has(key)) {\n          pairs.set(key, t.origin.name + \" -> \" + t.dest.name + ' [ label = \"' + _input + '\" ];');\n        } else {\n          /*\n           * To edit an existing line, split out the input(s), convert to number, sort them ascending, and add the new one\n           */\n          let _line: string = getOrDefault(pairs, key, \"\");\n          const _oldinput: string = _line.split('\"')[1];\n          const _toAdd: string[] = _oldinput.split(\",\");\n          _toAdd.push(_input);\n          _toAdd.sort();\n          _line = _line.replace('\"' + _oldinput + '\"', '\"' + _toAdd.toString() + '\"');\n          pairs.set(key, _line);\n        }\n      });\n\n      // return template literal\n      return `digraph fsa {\n          ${(Object.values(\n            this.#utils.determineStateOrder(this.#links, this.#tfunc, this.#states, this.#start, this.#accepts)\n          ) as string[])\n            .map(function (str: string) {\n              if (acceptArr.indexOf(str) !== -1) return str + \" [shape = doublecircle];\";\n              else return str;\n            })\n            .join(\"\\n\\t\")}\n          rankdir=LR;\n          node [shape = point ]; qi;\n          node [shape = circle];\n          qi -> ${this.#start.name};\n          ${(Object.values([...pairs]) as [string, string][])\n            .map(function ([, val]) {\n              return val;\n            })\n            .join(\"\\n\\t\")}\n      }\n      `;\n    }\n  }\n\n  return DFA;\n})();","import { DFA } from \"./DFA\";\nimport { State, Alphabet, NFATransition, Transition } from \"../components\";\n\nexport const NFA = (() => {\n  class NFA extends DFA {\n    // Transition function is different for NFA\n    constructor(\n      states: Set<State>,\n      alphabet: Alphabet,\n      tfunc: Set<NFATransition>,\n      start: State,\n      accepts: Set<State> | Record<string, never>\n    ) {\n      // Implicitly add ε to alphabet\n      if (!alphabet.sigma.includes(\"\")) alphabet.sigma.push(\"\");\n\n      // If NFATransition has multiple dest states, break them up into separate Transitions\n      const expandedTfunc: Set<Transition> = new Set<Transition>();\n      for (const _t of tfunc) {\n        _t.dest.forEach(_dest => {\n          expandedTfunc.add(new Transition(_t.origin, _dest, _t.input));\n        });\n      }\n\n      super(states, alphabet, expandedTfunc, start, accepts);\n    }\n\n    getType(): string {\n      return \"NFA\";\n    }\n  }\n\n  return NFA;\n})();","import { FSA } from \"../interfaces/FSA\";\nimport { State } from \"../components/State\";\nimport { DFA, NFA } from \"../automata\";\nimport { FSAUtils } from \"../utils\";\nimport { ErrorCode } from \"../globals/errors\";\nimport { instanceOf } from \"../globals/globals\";\n\nexport const simulateFSA = (\n  w: string | string[],\n  fsa: FSA,\n  logging: boolean = false,\n  returnEndState: boolean = false\n): boolean | string | string[] => {\n  if (instanceOf(NFA, fsa)) {\n    return simulateNFA(w, fsa as InstanceType<typeof NFA>, new FSAUtils(NFA), logging, returnEndState);\n  } else {\n    return simulateDFA(w, fsa as InstanceType<typeof DFA>, new FSAUtils(DFA), logging, returnEndState);\n  }\n};\n\nexport const stepOnceFSA = (\n  w: string,\n  qin: string | string[],\n  fsa: FSA,\n  logging: boolean = false\n): string | string[] => {\n  if (typeof w !== \"string\") {\n    if (logging) console.error(\"Input w was invalid type: %O\", w);\n    throw new TypeError();\n  }\n  if (typeof qin !== \"string\" && !Array.isArray(qin)) {\n    if (logging) console.error(\"Input state was invalid type: %O\", qin);\n    throw new TypeError();\n  }\n\n  // Step once\n  if (logging) console.log(\"Input Processing Started\");\n  let prevState: State | State[] = [];\n  if (typeof qin === \"string\") {\n    for (const state of fsa.getStates().values()) {\n      if (qin === state.name) prevState = state;\n    }\n    if (!prevState || (Array.isArray(prevState) && prevState.length === 0))\n      throw new Error(ErrorCode.INVALID_STATE_NAME);\n  } else {\n    prevState = [];\n    for (const state of fsa.getStates().values()) {\n      if (qin.includes(state.name)) prevState.push(state);\n    }\n    if (prevState.length !== qin.length) {\n      throw new Error(ErrorCode.INVALID_STATE_NAME);\n    }\n  }\n\n  let newState: State | State[];\n  if (instanceOf(NFA, fsa)) newState = [...(new FSAUtils(NFA).receiveInput(fsa, w, prevState) as Set<State>)];\n  else newState = new FSAUtils(DFA).receiveInput(fsa, w, prevState) as State;\n\n  if (logging) console.log(\"%o x '%s' -> %o\", JSON.stringify(prevState), w, JSON.stringify(newState));\n  if (logging) console.log(\"Input Processing Ended\");\n\n  if (newState instanceof State) return newState.name;\n  else {\n    const retArray: string[] = [];\n    for (const _s of newState) {\n      retArray.push(_s.name);\n    }\n    return retArray;\n  }\n};\n\n/*\n * Private methods\n */\nfunction simulateDFA(\n  w: string | string[],\n  dfa: InstanceType<typeof DFA>,\n  utils: InstanceType<typeof FSAUtils>,\n  logging: boolean,\n  returnEndState: boolean\n): boolean | string {\n  if (logging) console.log(\"Beginning DFA Simulation\");\n\n  //Accept either string or string[] for w\n  if (!Array.isArray(w)) {\n    if (typeof w === \"string\") w = [...w];\n    else {\n      if (logging) console.error(\"Input w was invalid type: %O\", w);\n      throw new TypeError();\n    }\n  }\n\n  // Step through the DFA\n  if (logging) console.log(\"Input Processing Started\");\n  let currentState: State = dfa.getStartState();\n  for (const char of w) {\n    const prevState: State = currentState;\n    currentState = utils.receiveInput(dfa, char, prevState) as State;\n    if (logging) console.log(\"%o x '%s' -> %o\", JSON.stringify(prevState), char, JSON.stringify(currentState));\n  }\n  if (logging) console.log(\"Input Processing Ended\");\n\n  // Check for acceptance\n  if (dfa.getAcceptStates().has(currentState)) {\n    if (logging) console.log(\"Input Accepted!\");\n    if (returnEndState) return currentState.name;\n    else return true;\n  } else {\n    if (logging) console.log(\"Input Rejected!\");\n    if (returnEndState) return currentState.name;\n    else return false;\n  }\n}\n\nfunction simulateNFA(\n  w: string | string[],\n  nfa: InstanceType<typeof NFA>,\n  utils: InstanceType<typeof FSAUtils>,\n  logging: boolean,\n  returnEndState: boolean\n): boolean | string[] {\n  if (logging) console.log(\"Beginning NFA Simulation\");\n\n  //Accept either string or string[] for w\n  if (!(w instanceof Array)) {\n    if (typeof w === \"string\") {\n      if (w === \"\") w = [\"\"];\n      else w = [...w];\n    } else {\n      if (logging) console.error(\"Input w was invalid type: %O\", w);\n      throw new TypeError();\n    }\n  }\n\n  if (logging) console.log(\"Input Processing Started\");\n  let currentState: State[] = [nfa.getStartState()];\n  for (const char of w) {\n    const prevState: State[] = currentState;\n    currentState = [...(utils.receiveInput(nfa, char, currentState) as Set<State>)];\n    if (logging) console.log(\"%o x '%s' -> %o\", JSON.stringify(prevState), char, JSON.stringify(currentState));\n  }\n  if (logging) console.log(\"Input Processing Ended\");\n\n  /*\n   * Check for acceptance or rejection.\n   * If returnEndState:\n   *    If accept, return all final accept states.\n   *    If reject, return all final states or if no final state return empty string\n   */\n  const retObj: string[] = [];\n  for (const _accState of nfa.getAcceptStates()) {\n    if (currentState.includes(_accState)) {\n      if (!returnEndState) {\n        if (logging) console.log(\"Input Accepted!\");\n        return true;\n      }\n      retObj.push(_accState.name);\n    }\n  }\n  if (retObj.length > 0) {\n    if (logging) console.log(\"Input Accepted!\");\n    return retObj;\n  }\n\n  if (logging) console.log(\"Input Rejected!\");\n  if (returnEndState) {\n    if (currentState.length > 0) {\n      for (const _cState of currentState) retObj.push(_cState.name);\n    }\n    return retObj;\n  } else {\n    return false;\n  }\n}"],"mappings":";;;;;;;;;AAAO,IAAM,YAA8C,OAAO,OAAO;AAAA,EACvE,yBAAyB;AAAA,EACzB,uBAAuB;AAAA,EACvB,oBAAoB;AAAA,EACpB,uBAAuB;AAAA,EACvB,oBAAoB;AAAA,EACpB,wBAAwB;AAAA,EACxB,sBAAsB;AAAA,EACtB,6BAA6B;AAAA,EAC7B,oBAAoB;AAAA,EACpB,uBAAuB;AAAA,EACvB,2BAA2B;AAAA,EAC3B,6BAA6B;AAAA,EAC7B,qBAAqB;AACvB,CAAC;;;ACZM,IAAM,QAAN,MAAY;AAAA,EAGjB,YAAY,MAAc;AACxB,SAAK,OAAO;AACZ,QAAI,CAAC,KAAK,KAAM,OAAM,IAAI,MAAM,UAAU,kBAAkB;AAAA,EAC9D;AACF;;;ACNO,IAAM,QAAQ,CAAC,UACpB,MAAM,OAAO,CAAC,GAAG,MAAM,OAAO,OAAO,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,GAAG,CAAC,CAA2B;AAG1F,IAAM,aAAa,CAAC,SACzB,OAAO,KAAK,IAAI,EAAE,OAAO,OAAK,KAAK,CAAC,IAAI,CAAC;AAapC,IAAM,uBAAuB,CAAC,WAAgC;AACnE,QAAM,QAAqB,oBAAI,IAAI;AACnC,aAAW,QAAQ,QAAQ;AACzB,QAAI,MAAM,IAAI,KAAK,IAAI,EAAG,QAAO;AACjC,UAAM,IAAI,KAAK,IAAI;AAAA,EACrB;AACA,SAAO;AACT;AAEO,IAAM,eAAe,CAAO,KAAgB,KAAQ,iBAAuB;AAChF,QAAM,MAAM,IAAI,IAAI,GAAG;AACvB,SAAO,OAAO,OAAO,eAAe;AACtC;AAEO,IAAM,aAAa,CAAC,MAAgB,QAAyB;AAClE,SAAO,eAAe,QAAS,QAAQ,KAAK,IAAI,KAAK,KAAK,SAAS,IAAI,YAAY;AACrF;AAEO,IAAM,aAAa,CAAI,QAAgB,aAA8B;AAC1E,aAAW,QAAQ,QAAQ;AACzB,QAAI,CAAC,SAAS,IAAI,IAAI,EAAG,QAAO;AAAA,EAClC;AACA,SAAO;AACT;;;ACzCO,IAAM,WAAN,MAAe;AAAA,EAGpB,YAAY,OAA0B;AACpC,QAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAI,OAAO,UAAU,SAAU,SAAQ,CAAC,GAAG,KAAK;AAAA,UAC3C,OAAM,IAAI,UAAU;AAAA,IAC3B;AACA,SAAK,QAAQ;AACb,QAAI,WAAW,MAAM,KAAK,KAAK,CAAC,EAAE,SAAS,EAAG,OAAM,IAAI,MAAM,UAAU,uBAAuB;AAAA,EACjG;AACF;;;ACZO,IAAM,gBAAN,MAAoB;AAAA,EAKzB,YAAY,QAAe,MAAe,OAAe;AACvD,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,SAAK,QAAQ;AAAA,EACf;AACF;;;ACVO,IAAM,aAAN,MAAiB;AAAA,EAKtB,YAAY,QAAe,MAAa,OAAe;AACrD,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,SAAK,QAAQ;AAAA,EACf;AACF;;;ACPO,IAAM,WAAN,MAAe;AAAA;AAAA;AAAA;AAAA;AAAA,EAKpB,OAAO,cACL,SACA,QACA,QACA,OACiB;AACjB,UAAM,WAA4B,oBAAI,IAAI;AAE1C,eAAW,MAAM,QAAQ;AAEvB,UAAI,CAAC,QAAQ,IAAI,GAAG,MAAM,GAAG;AAC3B,gBAAQ,MAAM,gCAAgC,KAAK,UAAU,GAAG,MAAM,CAAC;AACvE,cAAM,IAAI,MAAM,UAAU,sBAAsB;AAAA,MAClD;AACA,UAAI,CAAC,QAAQ,IAAI,GAAG,IAAI,GAAG;AACzB,gBAAQ,MAAM,8BAA8B,KAAK,UAAU,GAAG,IAAI,CAAC;AACnE,cAAM,IAAI,MAAM,UAAU,oBAAoB;AAAA,MAChD;AAEA,YAAM,gBAA6B,aAAa,QAAQ,GAAG,QAAQ,oBAAI,IAAI,CAAC;AAG5E,UAAI,KAAK,iBAAiB,GAAG,OAAO,KAAK,GAAG;AAC1C,YAAI,OAAO,IAAI,GAAG,MAAM,KAAK,cAAc,IAAI,GAAG,KAAK,GAAG;AACxD,mBAAS,IAAI,EAAE;AACf,wBAAc,OAAO,GAAG,KAAK;AAC7B,cAAI,cAAc,SAAS,GAAG;AAC5B,mBAAO,OAAO,GAAG,MAAM;AAAA,UACzB;AAAA,QACF,OAAO;AACL,gBAAM,IAAI,MAAM,UAAU,2BAA2B;AAAA,QACvD;AAAA,MACF,OAAO;AACL,cAAM,IAAI,MAAM,UAAU,kBAAkB;AAAA,MAC9C;AAAA,IACF;AAEA,QAAI,OAAO,OAAO,GAAG;AACnB,cAAQ,MAAM,gDAAgD;AAC9D,iBAAW,CAAC,KAAK,GAAG,KAAK,QAAQ;AAC/B,gBAAQ,MAAM,4BAA4B,IAAI,MAAM,CAAC,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC;AAAA,MACxE;AACA,YAAM,IAAI,MAAM,UAAU,2BAA2B;AAAA,IACvD;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,YAAY,SAAqB,OAA0C;AAChF,UAAM,SAAkC,oBAAI,IAAwB;AACpE,eAAW,SAAS,SAAS;AAC3B,iBAAW,QAAQ,MAAM,OAAO;AAC9B,cAAM,gBAA6B,aAAa,QAAQ,OAAO,oBAAI,IAAI,CAAC;AACxE,YAAI,OAAO,IAAI,KAAK,EAAG,eAAc,IAAI,IAAI;AAAA,YACxC,QAAO,IAAI,OAAO,oBAAI,IAAI,CAAC,IAAI,CAAC,CAAC;AAAA,MACxC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,oBACL,QACA,QACA,SACA,QACA,UACU;AACV,UAAM,cAAwB,CAAC;AAG/B,aAAS,oBAAI,IAAI;AACjB,eAAW,MAAM,QAAQ;AACvB,YAAM,gBAA6B,aAAa,QAAQ,GAAG,OAAO,MAAM,oBAAI,IAAI,CAAC;AACjF,UAAI,OAAO,IAAI,GAAG,OAAO,IAAI,EAAG,eAAc,IAAI,GAAG,KAAK,IAAI;AAAA,UACzD,QAAO,IAAI,GAAG,OAAO,MAAM,oBAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AAAA,IACzD;AAGA,SAAK,WAAW,aAAa,OAAO,MAAM,MAAM;AAGhD,UAAM,WAAqB,CAAC;AAC5B,IAAC,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,EAAc,IAAI,CAAC,UAAiB,SAAS,KAAK,MAAM,IAAI,CAAC;AACxF,UAAM,aAAa,SAAS,OAAO,OAAK,CAAC,YAAY,SAAS,CAAC,CAAC;AAChE,QAAI,WAAW,SAAS,GAAG;AACzB,cAAQ,KAAK,sEAAsE,UAAU;AAC7F,WAAK,iBAAiB,YAAY,SAAS,UAAU,MAAM;AAAA,IAC7D;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,iBACL,YACA,SACA,UACA,QACA;AAEA,eAAW,SAAS,SAAS;AAC3B,UAAI,WAAW,QAAQ,MAAM,IAAI,MAAM,GAAI,SAAQ,OAAO,KAAK;AAAA,IACjE;AAEA,eAAW,SAAS,UAAU;AAC5B,UAAI,WAAW,QAAQ,MAAM,IAAI,MAAM,GAAI,UAAS,OAAO,KAAK;AAAA,IAClE;AAEA,eAAW,MAAM,QAAQ;AACvB,UAAI,WAAW,QAAQ,GAAG,OAAO,IAAI,MAAM,MAAM,WAAW,QAAQ,GAAG,KAAK,IAAI,MAAM,GAAI,QAAO,OAAO,EAAE;AAAA,IAC5G;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,WAAW,KAAe,MAAc,QAAkC;AAC/E,QAAI,KAAK,IAAI;AACb,UAAM,UAAU,aAAa,QAAQ,MAAM,oBAAI,IAAY,CAAC;AAC5D,eAAW,MAAM,SAAS;AACxB,UAAI,IAAI,QAAQ,EAAE,MAAM,GAAI,MAAK,WAAW,KAAK,IAAI,MAAM;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,iBAAiB,OAAe,OAA0B;AAC/D,QAAI,UAAU,GAAI,QAAO;AACzB,WAAO,MAAM,MAAM,QAAQ,KAAK,MAAM;AAAA,EACxC;AACF;AASO,IAAM,YAAY,CACvB,QACA,UACA,aACA,OACA,YAC6B;AAE7B,QAAM,SAA0B,oBAAI,IAAI;AACxC,aAAW,MAAM,aAAa;AAC5B,QAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,MAAO,OAAM,IAAI,MAAM,UAAU,yBAAyB;AACxF,UAAM,UAAiB,aAAa,QAAQ,GAAG,MAAM,IAAwB;AAC7E,UAAM,QAAe,aAAa,QAAQ,GAAG,IAAI,IAAwB;AACzE,WAAO,IAAI,IAAI,WAAW,SAAS,OAAO,GAAG,KAAK,CAAC;AAAA,EACrD;AACA,SAAO,IAAI,IAAI,IAAI,IAAI,OAAO,OAAO,CAAC,GAAG,UAAU,QAAQ,OAAO,OAAO;AAC3E;;;AC7JO,IAAM,WAAN,cAAuB,SAAS;AAAA;AAAA,EAErC,OAAO,iBAAiB,OAAe,OAA0B;AAC/D,WAAO,MAAM,MAAM,QAAQ,KAAK,MAAM,MAAM,UAAU;AAAA,EACxD;AAAA;AAAA,EAGA,OAAO,iBAAiB,QAAyB,OAAyB;AACxE,QAAI,OAAO;AACX,WAAO,MAAM;AACX,aAAO;AAGP,YAAM,iBAA+B,MAAM,KAAK,MAAM,EAAE,OAAO,SAAO;AACpE,eAAO,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,UAAU;AAAA,MACrD,CAAC;AAGD,iBAAW,MAAM,gBAAgB;AAC/B,YAAI,CAAC,MAAM,SAAS,GAAG,IAAI,GAAG;AAC5B,gBAAM,KAAK,GAAG,IAAI;AAClB,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,cACL,SACA,QACA,QACA,OACiB;AACjB,UAAM,WAA4B,oBAAI,IAAI;AAE1C,eAAW,MAAM,QAAQ;AACvB,UAAI,OAAO;AAGX,UAAI,CAAC,QAAQ,IAAI,GAAG,MAAM,GAAG;AAC3B,gBAAQ,MAAM,gCAAgC,KAAK,UAAU,GAAG,MAAM,CAAC;AACvE,cAAM,IAAI,MAAM,UAAU,sBAAsB;AAAA,MAClD;AACA,UAAI,CAAC,QAAQ,IAAI,GAAG,IAAI,GAAG;AACzB,gBAAQ,MAAM,8BAA8B,KAAK,UAAU,GAAG,IAAI,CAAC;AACnE,cAAM,IAAI,MAAM,UAAU,oBAAoB;AAAA,MAChD;AAEA,YAAM,gBAA6B,aAAa,QAAQ,GAAG,QAAQ,oBAAI,IAAI,CAAC;AAG5E,iBAAW,WAAW,UAAU;AAC9B,YAAI,QAAQ,WAAW,GAAG,UAAU,QAAQ,SAAS,GAAG,QAAQ,QAAQ,UAAU,GAAG,MAAO,QAAO;AAAA,MACrG;AAGA,UAAI,CAAC,MAAM;AACT,YAAI,OAAO,IAAI,GAAG,MAAM,GAAG;AACzB,cAAI,KAAK,iBAAiB,GAAG,OAAO,KAAK,GAAG;AAC1C,qBAAS,IAAI,EAAE;AAAA,UACjB,OAAO;AACL,kBAAM,IAAI,MAAM,UAAU,kBAAkB;AAAA,UAC9C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEO,IAAM,YAAY,CACvB,QACA,UACA,aACA,OACA,YAC6B;AAE7B,QAAM,SAA6B,oBAAI,IAAI;AAC3C,aAAW,MAAM,aAAa;AAC5B,QAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,MAAO,CAAC,GAAG,SAAS,GAAG,UAAU;AACnD,YAAM,IAAI,MAAM,UAAU,yBAAyB;AACrD,UAAM,UAAiB,aAAa,QAAQ,GAAG,MAAM,IAAwB;AAC7E,UAAM,QAAkB,GAAG,GAAG,MAAM,GAAG;AAEvC,UAAM,aAAsB,CAAC;AAC7B,UAAM,QAAQ,WAAS;AACrB,iBAAW,KAAK,aAAa,QAAQ,OAAO,IAAwB,CAAC;AAAA,IACvE,CAAC;AAED,WAAO,IAAI,IAAI,cAAc,SAAS,YAAY,GAAG,KAAK,CAAC;AAAA,EAC7D;AACA,SAAO,IAAI,IAAI,IAAI,IAAI,OAAO,OAAO,CAAC,GAAG,UAAU,QAAQ,OAAO,OAAO;AAC3E;;;ACzFO,IAAM,WAAY,uBAAM;AAI7B,WAAS,gBAAgB,KAA+B,OAAe,OAAqB;AAC1F,QAAI,IAAI,YAAY,EAAE,MAAM,QAAQ,KAAK,MAAM,GAAI,OAAM,IAAI,MAAM,UAAU,kBAAkB;AAC/F,QAAI,CAAC,IAAI,UAAU,EAAE,IAAI,KAAK,EAAG,OAAM,IAAI,MAAM,UAAU,qBAAqB;AAEhF,UAAM,OAAO,MAAM,KAAK,IAAI,SAAS,CAAC,EAAE,KAAK,SAAO;AAClD,aAAO,IAAI,WAAW,SAAS,IAAI,UAAU;AAAA,IAC/C,CAAC;AAED,QAAI,KAAM,QAAO,KAAK;AAAA,QACjB,OAAM,IAAI,MAAM,UAAU,yBAAyB;AAAA,EAC1D;AAEA,WAAS,gBAAgB,KAA+B,OAAe,OAA4B;AACjG,QAAI,OAAqB,CAAC;AAC1B,QAAI,IAAI,YAAY,EAAE,MAAM,QAAQ,KAAK,MAAM,GAAI,OAAM,IAAI,MAAM,UAAU,kBAAkB;AAG/F,YAAQ,iBAAiB,IAAI,SAAS,GAAG,KAAK;AAG9C,QAAI,UAAU,GAAI,QAAO,IAAI,IAAW,KAAK;AAG7C,eAAW,MAAM,OAAO;AACtB,YAAM,aAA2B,MAAM,KAAK,IAAI,SAAS,CAAC,EAAE,OAAO,SAAO;AACxE,eAAO,IAAI,WAAW,MAAM,IAAI,UAAU;AAAA,MAC5C,CAAC;AAED,aAAO,KAAK,OAAO,UAAU;AAAA,IAC/B;AAEA,QAAI,YAAqB,CAAC;AAC1B,QAAI,KAAK,SAAS,GAAG;AACnB,iBAAW,MAAM,KAAM,WAAU,KAAK,GAAG,IAAI;AAAA,IAC/C,WAAW,KAAK,WAAW,GAAG;AAC5B,gBAAU,KAAK,KAAK,CAAC,EAAE,IAAI;AAAA,IAC7B,OAAO;AAEL,aAAO,oBAAI,IAAW;AAAA,IACxB;AAGA,UAAM,SAAqB,IAAI,IAAW,iBAAiB,IAAI,SAAS,GAAG,SAAS,CAAC;AAErF,WAAO;AAAA,EACT;AAEA,WAAS,iBAAiB,QAAyB,OAAyB;AAC1E,WAAO,SAAS,iBAAiB,QAAQ,KAAK;AAAA,EAChD;AAAA,EAEA,MAAMA,UAAS;AAAA,IAGb,YAAY,GAA4B;AACtC,WAAK,QAAQ;AAAA,IACf;AAAA,IAEA,aAAa,KAAU,OAAe,OAA4C;AAChF,UAAI,WAAW,KAAK,GAAG,GAAG;AACxB,YAAI,iBAAiB,MAAO,QAAO,gBAAgB,KAAiC,OAAO,CAAC,KAAK,CAAC;AAAA,YAC7F,QAAO,gBAAgB,KAAiC,OAAO,KAAK;AAAA,MAC3E,OAAO;AACL,YAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,cAAI,MAAM,SAAS,GAAG;AACpB,oBAAQ,MAAM,iDAAiD;AAC/D,kBAAM,IAAI,MAAM,UAAU,mBAAmB;AAAA,UAC/C,OAAO;AACL,oBAAQ,MAAM,CAAC;AAAA,UACjB;AAAA,QACF;AACA,eAAO,gBAAgB,KAAiC,OAAO,KAAK;AAAA,MACtE;AAAA,IACF;AAAA,IAEA,cACE,SACA,QACA,QACA,OACiB;AACjB,UAAI,KAAK,UAAU,KAAK;AACtB,eAAO,SAAS,cAAc,SAAS,QAAQ,QAAQ,KAAK;AAAA,MAC9D,OAAO;AACL,eAAO,SAAS,cAAc,SAAS,QAAQ,QAAQ,KAAK;AAAA,MAC9D;AAAA,IACF;AAAA,IAEA,YAAY,SAAqB,OAA0C;AACzE,aAAO,SAAS,YAAY,SAAS,KAAK;AAAA,IAC5C;AAAA,IAEA,oBACE,QACA,QACA,SACA,QACA,UACU;AACV,aAAO,SAAS,oBAAoB,QAAQ,QAAQ,SAAS,QAAQ,QAAQ;AAAA,IAC/E;AAAA,EACF;AAEA,SAAOA;AACT,GAAG;AAGI,IAAM,YAAY,CACvB,QACA,UACA,aACA,OACA,YACQ;AAER,QAAM,UAA8B,oBAAI,IAAI;AAC5C,MAAI,OAAO,WAAW,UAAU;AAC9B,YAAQ,IAAI,QAAQ,IAAI,MAAM,MAAM,CAAC;AAAA,EACvC,WAAW,MAAM,QAAQ,MAAM,GAAG;AAChC,eAAW,SAAS,QAAQ;AAC1B,UAAI,CAAC,QAAQ,IAAI,KAAK,EAAG,SAAQ,IAAI,OAAO,IAAI,MAAM,KAAK,CAAC;AAAA,IAC9D;AAAA,EACF,OAAO;AACL,UAAM,IAAI,UAAU,OAAO,MAAM,CAAC;AAAA,EACpC;AAGA,QAAM,YAAY,IAAI,SAAS,QAAQ;AACvC,MAAI,OAAO,UAAU,SAAU,OAAM,IAAI,UAAU,OAAO,KAAK,CAAC;AAChE,QAAM,SAAgB,aAAa,SAAS,OAAO,IAAwB;AAE3E,QAAM,WAAuB,oBAAI,IAAI;AACrC,MAAI,OAAO,YAAY,UAAU;AAC/B,QAAI,QAAQ,IAAI,OAAO,EAAG,UAAS,IAAI,aAAa,SAAS,SAAS,IAAwB,CAAC;AAAA,EACjG,WAAW,MAAM,QAAQ,OAAO,GAAG;AACjC,eAAW,SAAS,SAAS;AAC3B,eAAS,IAAI,aAAa,SAAS,OAAO,IAAwB,CAAC;AAAA,IACrE;AAAA,EACF,OAAO;AACL,UAAM,IAAI,UAAU,OAAO,OAAO,CAAC;AAAA,EACrC;AAOA,MAAI;AACJ,MAAI,CAAC,MAAM,QAAQ,WAAW,KAAK,OAAO,gBAAgB,SAAU,kBAAiB,CAAC,WAAW;AAAA,WACxF,MAAM,QAAQ,WAAW,EAAG,kBAAiB;AAAA,MACjD,OAAM,IAAI,UAAU,OAAO,WAAW,CAAC;AAE5C,aAAW,MAAM,gBAAgB;AAC/B,QAAI,GAAG,GAAG,QAAQ,GAAG,KAAK,MAAM,GAAG,UAAU;AAC3C,aAAO,UAAU,SAAS,WAAW,gBAAgB,QAAQ,QAAQ;AAAA,EACzE;AACA,SAAO,UAAU,SAAS,WAAW,gBAAgB,QAAQ,QAAQ;AACvE;;;ACzKO,IAAM,MAAO,uBAAM;AAN1B;AAAA,EAOE,MAAMC,KAAmB;AAAA,IAavB,YACE,QACA,UACA,OACA,OACA,SACA;AAjBF;AAAA;AACA;AACA;AACA;AACA;AAGA;AAAA;AACA;AAAA,iCAAmC,oBAAI,IAAI;AAC3C;AAAA;AAUE,yBAAK,QAAS,IAAI,SAAS,KAAK,WAAyB;AAGzD,UAAI,qBAAqB,MAAM,EAAG,OAAM,IAAI,MAAM,UAAU,qBAAqB;AACjF,yBAAK,SAAU;AAEf,yBAAK,WAAY;AAGjB,yBAAK,QAAS,mBAAK,QAAO,YAAY,mBAAK,UAAS,mBAAK,UAAS;AAGlE,UAAI,CAAC,OAAO,IAAI,KAAK,EAAG,OAAM,IAAI,MAAM,UAAU,qBAAqB;AACvE,yBAAK,QAAS;AACd,UAAI,OAAO,KAAK,OAAO,EAAE,WAAW,KAAK,QAAQ,gBAAgB,OAAQ,WAAU,oBAAI,IAAI,CAAC,CAAC;AAC7F,UAAI,CAAC,WAAW,SAAuB,MAAM,EAAG,OAAM,IAAI,MAAM,UAAU,kBAAkB;AAC5F,yBAAK,UAAW;AAGhB,yBAAK,QAAS,mBAAK,QAAO,cAAc,mBAAK,UAAS,mBAAK,SAAQ,OAAO,mBAAK,UAAS;AAAA,IAC1F;AAAA;AAAA;AAAA;AAAA,IAKA,YAAwB;AACtB,aAAO,mBAAK;AAAA,IACd;AAAA,IACA,cAAwB;AACtB,aAAO,mBAAK;AAAA,IACd;AAAA,IACA,WAA4B;AAC1B,aAAO,mBAAK;AAAA,IACd;AAAA,IACA,gBAAuB;AACrB,aAAO,mBAAK;AAAA,IACd;AAAA,IACA,kBAA8B;AAC5B,aAAO,mBAAK;AAAA,IACd;AAAA,IACA,UAAkB;AAChB,aAAO;AAAA,IACT;AAAA,IAEA,kBAA0B;AAExB,YAAM,YAAsB,CAAC;AAC7B,iBAAW,SAAS,mBAAK,UAAU,WAAU,KAAK,MAAM,IAAI;AAG5D,YAAM,QAA6B,oBAAI,IAAI;AAC3C,MAAC,OAAO,OAAO,CAAC,GAAG,mBAAK,OAAM,CAAC,EAAmB,IAAI,SAAU,GAAe;AAC7E,cAAM,MAAc,EAAE,OAAO,OAAO,EAAE,KAAK;AAC3C,YAAI,SAAiB,EAAE;AACvB,YAAI,WAAW,GAAI,UAAS;AAC5B,YAAI,CAAC,MAAM,IAAI,GAAG,GAAG;AACnB,gBAAM,IAAI,KAAK,EAAE,OAAO,OAAO,SAAS,EAAE,KAAK,OAAO,iBAAiB,SAAS,MAAM;AAAA,QACxF,OAAO;AAIL,cAAI,QAAgB,aAAa,OAAO,KAAK,EAAE;AAC/C,gBAAM,YAAoB,MAAM,MAAM,GAAG,EAAE,CAAC;AAC5C,gBAAM,SAAmB,UAAU,MAAM,GAAG;AAC5C,iBAAO,KAAK,MAAM;AAClB,iBAAO,KAAK;AACZ,kBAAQ,MAAM,QAAQ,MAAM,YAAY,KAAK,MAAM,OAAO,SAAS,IAAI,GAAG;AAC1E,gBAAM,IAAI,KAAK,KAAK;AAAA,QACtB;AAAA,MACF,CAAC;AAGD,aAAO;AAAA,YACA,OAAO;AAAA,QACR,mBAAK,QAAO,oBAAoB,mBAAK,SAAQ,mBAAK,SAAQ,mBAAK,UAAS,mBAAK,SAAQ,mBAAK,SAAQ;AAAA,MACpG,EACG,IAAI,SAAU,KAAa;AAC1B,YAAI,UAAU,QAAQ,GAAG,MAAM,GAAI,QAAO,MAAM;AAAA,YAC3C,QAAO;AAAA,MACd,CAAC,EACA,KAAK,KAAM,CAAC;AAAA;AAAA;AAAA;AAAA,kBAIP,mBAAK,QAAO,IAAI;AAAA,YACrB,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC,EACxB,IAAI,SAAU,CAAC,EAAE,GAAG,GAAG;AACtB,eAAO;AAAA,MACT,CAAC,EACA,KAAK,KAAM,CAAC;AAAA;AAAA;AAAA,IAGrB;AAAA,EACF;AAhHE;AACA;AACA;AACA;AACA;AAGA;AACA;AACA;AAyGF,SAAOA;AACT,GAAG;;;ACzHI,IAAM,MAAO,uBAAM;AAAA,EACxB,MAAMC,aAAY,IAAI;AAAA;AAAA,IAEpB,YACE,QACA,UACA,OACA,OACA,SACA;AAEA,UAAI,CAAC,SAAS,MAAM,SAAS,EAAE,EAAG,UAAS,MAAM,KAAK,EAAE;AAGxD,YAAM,gBAAiC,oBAAI,IAAgB;AAC3D,iBAAW,MAAM,OAAO;AACtB,WAAG,KAAK,QAAQ,WAAS;AACvB,wBAAc,IAAI,IAAI,WAAW,GAAG,QAAQ,OAAO,GAAG,KAAK,CAAC;AAAA,QAC9D,CAAC;AAAA,MACH;AAEA,YAAM,QAAQ,UAAU,eAAe,OAAO,OAAO;AAAA,IACvD;AAAA,IAEA,UAAkB;AAChB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAOA;AACT,GAAG;;;AC1BI,IAAM,cAAc,CACzB,GACA,KACA,UAAmB,OACnB,iBAA0B,UACM;AAChC,MAAI,WAAW,KAAK,GAAG,GAAG;AACxB,WAAO,YAAY,GAAG,KAAiC,IAAI,SAAS,GAAG,GAAG,SAAS,cAAc;AAAA,EACnG,OAAO;AACL,WAAO,YAAY,GAAG,KAAiC,IAAI,SAAS,GAAG,GAAG,SAAS,cAAc;AAAA,EACnG;AACF;AAEO,IAAM,cAAc,CACzB,GACA,KACA,KACA,UAAmB,UACG;AACtB,MAAI,OAAO,MAAM,UAAU;AACzB,QAAI,QAAS,SAAQ,MAAM,gCAAgC,CAAC;AAC5D,UAAM,IAAI,UAAU;AAAA,EACtB;AACA,MAAI,OAAO,QAAQ,YAAY,CAAC,MAAM,QAAQ,GAAG,GAAG;AAClD,QAAI,QAAS,SAAQ,MAAM,oCAAoC,GAAG;AAClE,UAAM,IAAI,UAAU;AAAA,EACtB;AAGA,MAAI,QAAS,SAAQ,IAAI,0BAA0B;AACnD,MAAI,YAA6B,CAAC;AAClC,MAAI,OAAO,QAAQ,UAAU;AAC3B,eAAW,SAAS,IAAI,UAAU,EAAE,OAAO,GAAG;AAC5C,UAAI,QAAQ,MAAM,KAAM,aAAY;AAAA,IACtC;AACA,QAAI,CAAC,aAAc,MAAM,QAAQ,SAAS,KAAK,UAAU,WAAW;AAClE,YAAM,IAAI,MAAM,UAAU,kBAAkB;AAAA,EAChD,OAAO;AACL,gBAAY,CAAC;AACb,eAAW,SAAS,IAAI,UAAU,EAAE,OAAO,GAAG;AAC5C,UAAI,IAAI,SAAS,MAAM,IAAI,EAAG,WAAU,KAAK,KAAK;AAAA,IACpD;AACA,QAAI,UAAU,WAAW,IAAI,QAAQ;AACnC,YAAM,IAAI,MAAM,UAAU,kBAAkB;AAAA,IAC9C;AAAA,EACF;AAEA,MAAI;AACJ,MAAI,WAAW,KAAK,GAAG,EAAG,YAAW,CAAC,GAAI,IAAI,SAAS,GAAG,EAAE,aAAa,KAAK,GAAG,SAAS,CAAgB;AAAA,MACrG,YAAW,IAAI,SAAS,GAAG,EAAE,aAAa,KAAK,GAAG,SAAS;AAEhE,MAAI,QAAS,SAAQ,IAAI,mBAAmB,KAAK,UAAU,SAAS,GAAG,GAAG,KAAK,UAAU,QAAQ,CAAC;AAClG,MAAI,QAAS,SAAQ,IAAI,wBAAwB;AAEjD,MAAI,oBAAoB,MAAO,QAAO,SAAS;AAAA,OAC1C;AACH,UAAM,WAAqB,CAAC;AAC5B,eAAW,MAAM,UAAU;AACzB,eAAS,KAAK,GAAG,IAAI;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AACF;AAKA,SAAS,YACP,GACA,KACA,OACA,SACA,gBACkB;AAClB,MAAI,QAAS,SAAQ,IAAI,0BAA0B;AAGnD,MAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,QAAI,OAAO,MAAM,SAAU,KAAI,CAAC,GAAG,CAAC;AAAA,SAC/B;AACH,UAAI,QAAS,SAAQ,MAAM,gCAAgC,CAAC;AAC5D,YAAM,IAAI,UAAU;AAAA,IACtB;AAAA,EACF;AAGA,MAAI,QAAS,SAAQ,IAAI,0BAA0B;AACnD,MAAI,eAAsB,IAAI,cAAc;AAC5C,aAAW,QAAQ,GAAG;AACpB,UAAM,YAAmB;AACzB,mBAAe,MAAM,aAAa,KAAK,MAAM,SAAS;AACtD,QAAI,QAAS,SAAQ,IAAI,mBAAmB,KAAK,UAAU,SAAS,GAAG,MAAM,KAAK,UAAU,YAAY,CAAC;AAAA,EAC3G;AACA,MAAI,QAAS,SAAQ,IAAI,wBAAwB;AAGjD,MAAI,IAAI,gBAAgB,EAAE,IAAI,YAAY,GAAG;AAC3C,QAAI,QAAS,SAAQ,IAAI,iBAAiB;AAC1C,QAAI,eAAgB,QAAO,aAAa;AAAA,QACnC,QAAO;AAAA,EACd,OAAO;AACL,QAAI,QAAS,SAAQ,IAAI,iBAAiB;AAC1C,QAAI,eAAgB,QAAO,aAAa;AAAA,QACnC,QAAO;AAAA,EACd;AACF;AAEA,SAAS,YACP,GACA,KACA,OACA,SACA,gBACoB;AACpB,MAAI,QAAS,SAAQ,IAAI,0BAA0B;AAGnD,MAAI,EAAE,aAAa,QAAQ;AACzB,QAAI,OAAO,MAAM,UAAU;AACzB,UAAI,MAAM,GAAI,KAAI,CAAC,EAAE;AAAA,UAChB,KAAI,CAAC,GAAG,CAAC;AAAA,IAChB,OAAO;AACL,UAAI,QAAS,SAAQ,MAAM,gCAAgC,CAAC;AAC5D,YAAM,IAAI,UAAU;AAAA,IACtB;AAAA,EACF;AAEA,MAAI,QAAS,SAAQ,IAAI,0BAA0B;AACnD,MAAI,eAAwB,CAAC,IAAI,cAAc,CAAC;AAChD,aAAW,QAAQ,GAAG;AACpB,UAAM,YAAqB;AAC3B,mBAAe,CAAC,GAAI,MAAM,aAAa,KAAK,MAAM,YAAY,CAAgB;AAC9E,QAAI,QAAS,SAAQ,IAAI,mBAAmB,KAAK,UAAU,SAAS,GAAG,MAAM,KAAK,UAAU,YAAY,CAAC;AAAA,EAC3G;AACA,MAAI,QAAS,SAAQ,IAAI,wBAAwB;AAQjD,QAAM,SAAmB,CAAC;AAC1B,aAAW,aAAa,IAAI,gBAAgB,GAAG;AAC7C,QAAI,aAAa,SAAS,SAAS,GAAG;AACpC,UAAI,CAAC,gBAAgB;AACnB,YAAI,QAAS,SAAQ,IAAI,iBAAiB;AAC1C,eAAO;AAAA,MACT;AACA,aAAO,KAAK,UAAU,IAAI;AAAA,IAC5B;AAAA,EACF;AACA,MAAI,OAAO,SAAS,GAAG;AACrB,QAAI,QAAS,SAAQ,IAAI,iBAAiB;AAC1C,WAAO;AAAA,EACT;AAEA,MAAI,QAAS,SAAQ,IAAI,iBAAiB;AAC1C,MAAI,gBAAgB;AAClB,QAAI,aAAa,SAAS,GAAG;AAC3B,iBAAW,WAAW,aAAc,QAAO,KAAK,QAAQ,IAAI;AAAA,IAC9D;AACA,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;","names":["FSAUtils","DFA","NFA"]}

package/package.json

@@ -1,80 +1,74 @@
-{
-  "name": "fas-js",
-  "description": "Finate State Automata JS Solutions",
-  "version": "1.3.1",
-  "source": "src/modules.js",
-  "main": "lib/bundle.js",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/jml6m/fas-js.git"
-  },
-  "scripts": {
-    "build": "browserify -t [ babelify --presets [ @babel/preset-env @babel/preset-flow ] ] src/modules.js --standalone fasJs -p tinyify > lib/bundle.js",
-    "prebuild": "npm run clean",
-    "clean": "rimraf lib/*",
-    "prepublishOnly": "npm run build && npm run flow check",
-    "flow": "flow",
-    "test": "npm run build && cross-env NODE_ENV=test nyc --check-coverage --lines 90 mocha --require @babel/register ./test/**/*.spec.js"
-  },
-  "precommit": "test",
-  "author": "Joseph Lewkovich",
-  "license": "GPL-3.0-or-later",
-  "devDependencies": {
-    "@babel/core": "^7.6.0",
-    "@babel/plugin-proposal-class-properties": "^7.5.5",
-    "@babel/preset-env": "^7.6.0",
-    "@babel/preset-flow": "^7.0.0",
-    "@babel/register": "^7.6.0",
-    "babel-plugin-istanbul": "^5.2.0",
-    "babelify": "^10.0.0",
-    "browserify": "^16.5.0",
-    "chai": "^4.2.0",
-    "cross-env": "^6.0.0",
-    "flow-bin": "^0.107.0",
-    "mocha": "^6.2.0",
-    "nyc": "^14.1.1",
-    "pre-commit": "^1.2.2",
-    "rimraf": "^3.0.0",
-    "tinyify": "^2.5.1"
-  },
-  "nyc": {
-    "sourceMap": false,
-    "instrument": false,
-    "include": [
-      "src/**/*.js"
-    ],
-    "reporter": [
-      "lcov",
-      "text-summary"
-    ],
-    "temp-dir": "./coverage/.nyc_output"
-  },
-  "bugs": {
-    "url": "https://github.com/jml6m/fas-js/issues"
-  },
-  "homepage": "https://github.com/jml6m/fas-js#readme",
-  "directories": {
-    "lib": "lib",
-    "test": "test"
-  },
-  "keywords": [
-    "state-machine",
-    "fsa",
-    "finite",
-    "state",
-    "automata",
-    "automaton",
-    "dfa",
-    "ndfa",
-    "turing"
-  ],
-  "dependencies": {
-    "@babel/runtime": "7.6.0",
-    "chalk": "^2.4.2",
-    "core-js": "^3.2.1",
-    "regenerator-runtime": "^0.13.3"
-  },
-  "files": [
-    "lib/bundle.js"
-  ]
-}
+{
+  "name": "fas-js",
+  "description": "Finate State Automata JS Solutions",
+  "version": "1.4.0",
+  "type": "module",
+  "main": "./lib/index.cjs",
+  "module": "./lib/index.js",
+  "types": "./lib/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./lib/index.d.ts",
+      "import": "./lib/index.js",
+      "require": "./lib/index.cjs"
+    },
+    "./bundle": {
+      "default": "./lib/bundle.js"
+    }
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/jml6m/fas-js.git"
+  },
+  "scripts": {
+    "build": "tsup",
+    "prebuild": "node scripts/prebuild.mjs",
+    "postbuild": "node scripts/postbuild.mjs",
+    "clean": "node scripts/prebuild.mjs",
+    "prepublishOnly": "npm run build && npm test",
+    "typecheck": "tsc --noEmit",
+    "test": "npm run build && cross-env NODE_OPTIONS=--import=tsx c8 mocha \"test/**/*.spec.js\"",
+    "audit:ci": "npm audit --audit-level=high",
+    "git:reset": "git reset --hard HEAD && git clean -fd",
+    "npm:reinstall": "node scripts/reinstall.js"
+  },
+  "author": "Joseph Lewkovich",
+  "license": "GPL-3.0-or-later",
+  "devDependencies": {
+    "@types/chai": "^4.3.20",
+    "@types/mocha": "^10.0.10",
+    "c8": "^10.1.3",
+    "chai": "^4.5.0",
+    "cross-env": "^7.0.3",
+    "mocha": "^11.7.1",
+    "rimraf": "^6.0.1",
+    "tsup": "^8.5.0",
+    "tsx": "^4.20.3",
+    "typescript": "^5.8.3"
+  },
+  "files": [
+    "lib"
+  ],
+  "bugs": {
+    "url": "https://github.com/jml6m/fas-js/issues"
+  },
+  "homepage": "https://github.com/jml6m/fas-js#readme",
+  "directories": {
+    "lib": "lib",
+    "test": "test"
+  },
+  "keywords": [
+    "state-machine",
+    "fsa",
+    "finite",
+    "state",
+    "automata",
+    "automaton",
+    "dfa",
+    "ndfa",
+    "turing"
+  ],
+  "engines": {
+    "node": ">=18"
+  }
+}