3 ms·
I doubt the logicians do; the most applied of the bunch I can think of is Büchi, who proved the equivalence between finite automata and monadic second-order log
by 082349872349872 2y ago
I doubt the logicians do; the most applied of the bunch I can think of is Büchi, who proved the equivalence between finite automata and monadic second-order logic.
(I've written elsewhere than people can cue off of context-dependent grammars, but other mammals are limited to regexps; now that I think about it more, they may even mostly operate in the star-free first-order regime... [but thinking about that a bit more, I'd say most people also prefer limited logic cues])