@article{10.1145/3090064.3090066,
    Abstract = {Already in the seventies, strong results illustrating the intimate relationship between category theory and automata theory have been described and are still investigated. In this column, we provide a uniform presentation of the basic concepts that underlie minimization results in automata theory. We then use this knowledge for introducing a new model of automata that is an hybrid of deterministic finite automata and automata weighted over a field. These automata are very natural, and enjoy minimization result by design.The presentation of this paper is indeed categorical in essence, but it assumes no prior knowledge from the reader. It is also non-conventional in that it is neither algebraic, nor co-algebraic oriented.},
    Address = {New York, NY, USA},
    Author = {Colcombet, Thomas and Petri\c{s}an, Daniela},
    File = {Automata and minimization - 3090064.3090066.pdf},
    Journal = {ACM SIGLOG News},
    Month = {may},
    Number = {2},
    Pages = {4--27},
    Publisher = {Association for Computing Machinery},
    Title = {Automata and Minimization},
    URL = {https://doi.org/10.1145/3090064.3090066},
    Volume = {4},
    Year = {2017},
    bdsk-url-1 = {https://doi.org/10.1145/3090064.3090066},
    date-added = {2022-06-01 13:01:18 +0200},
    date-modified = {2022-06-01 13:01:18 +0200},
    issue_date = {April 2017},
    numpages = {24},
    doi = {10.1145/3090064.3090066}
}

@article{10.1145/3090064.3090066, Abstract = {Already in the seventies, strong results illustrating the intimate relationship between category theory and automata theory have been described and are still investigated. In this column, we provide a uniform presentation of the basic concepts that underlie minimization results in automata theory. We then use this knowledge for introducing a new model of automata that is an hybrid of deterministic finite automata and automata weighted over a field. These automata are very natural, and enjoy minimization result by design.The presentation of this paper is indeed categorical in essence, but it assumes no prior knowledge from the reader. It is also non-conventional in that it is neither algebraic, nor co-algebraic oriented.}, Address = {New York, NY, USA}, Author = {Colcombet, Thomas and Petri\c{s}an, Daniela}, File = {Automata and minimization - 3090064.3090066.pdf}, Journal = {ACM SIGLOG News}, Month = {may}, Number = {2}, Pages = {4--27}, Publisher = {Association for Computing Machinery}, Title = {Automata and Minimization}, URL = {https://doi.org/10.1145/3090064.3090066}, Volume = {4}, Year = {2017}, bdsk-url-1 = {https://doi.org/10.1145/3090064.3090066}, date-added = {2022-06-01 13:01:18 +0200}, date-modified = {2022-06-01 13:01:18 +0200}, issue_date = {April 2017}, numpages = {24}, doi = {10.1145/3090064.3090066} }