2000 character limit reached
A Congruence-based Perspective on Automata Minimization Algorithms
Published 14 Jun 2019 in cs.FL | (1906.06194v2)
Abstract: In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.