Mario Román

Home

❯

notes

❯

non deterministic finite state automaton over a category

non-deterministic finite state automaton over a category

May 17, 20241 min read

non-deterministic-finite-state-automaton-over-a-category

Tags. automata as functors, automata as fibrations.

References.

  • The Categorical Contours of the Chomsky-Schützenberger representation theorem (Mellies, Zeilberger, 2024)

Graph View

Mario Román (2026), CC-BY-SA. Built mostly with Quartz and Write.

  • GitHub
  • ArXiv
  • OrcID