« first day (2886 days earlier)      last day (1557 days later) » 

2:37 PM
33
Q: Planar regular languages

Hendrik JanIn my class a student asked whether all finite automata could be drawn without crossing edges (it seems all my examples did). Of course the answer is negative, the obvious automaton for the language $\{\; x\in\{a,b\}^* \mid \#_a(x)+2\#_b(x) \equiv 0 \mod 5 \;\}$ has the structure of $K_5$, the co...

 

« first day (2886 days earlier)      last day (1557 days later) »