Blogs I Follow

Recent Posts
 ALogTime, LogCFL, and threshold circuits: dreams of fast solutions November 2, 2017
 A subset interpretation (with context morphisms) of the sequent calculus for predicate logic September 24, 2017
 Logic without negation and falsehood December 11, 2016
 Logic without truth September 3, 2016
 Learning category theory: a necessary evil? April 3, 2016
 A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata November 15, 2015
 On Zeros of a Polynomial in a Finite Grid: the AlonFuredi bound September 19, 2015
 Groupoids August 3, 2015
 Reversibility of binary relations, substochastic matrices, and partial functions March 22, 2015
 Algebraic characterizations of inverse semigroups and strongly regular rings December 6, 2014
 Gentzen’s consistency proof is more impressive than you expect December 5, 2013
Recent Comments
 gentzen on ALogTime, LogCFL, and threshold circuits: dreams of fast solutions
 gentzen on ALogTime, LogCFL, and threshold circuits: dreams of fast solutions
 A subset interpretation (with context morphisms) of the sequent calculus for predicate logic  Gentzen translated on Logic without truth
 A subset interpretation (with context morphisms) of the sequent calculus for predicate logic  Gentzen translated on Logic without negation and falsehood
 gentzen on Logic without negation and falsehood
 Paolo Logic on Logic without negation and falsehood
 Logic without negation and falsehood  Gentzen translated on Logic without truth
 vznvzn on Logic without truth
 gentzen on Logic without truth
 vznvzn on Logic without truth
 gentzen on Logic without truth
 Learning category theory: a necessary evil?  Gentzen translated on A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata
 vznvzn on A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata
 gentzen on A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata
 vznvzn on A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata
Category Archives: isomorphism
Learning category theory: a necessary evil?
The end of my last blog post (about isomorphism testing of reversible deterministic finite automata) explained how category theory gave me the idea that the simplified variant of my question about permutation group isomorphism should be easy to solve: The idea to consider … Continue reading
A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata
A deterministic finite automaton (DFA) is a 5tuple, , consisting of a finite set of states a finite set of input symbols a (partial) transition function an initial state a set of accept states An isomorphism between two DFAs and … Continue reading
Posted in automata, inverse semigroups, isomorphism, partial functions
4 Comments