2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Fabian Lenke, Stefan Milius, Henning Urbat +1
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the o…