hexspeaker

4 ms·

1. 1.▲
   by hexspeaker 7y ago

   Yes for regular languages but not for higher level ones. For example, deterministic context-free is a subset of context-free. For languages that are turing complete, the question is less about ability to compute and more about the speed at
2. 2.▲
   by hexspeaker 7y ago

   Deterministic Finite Automaton. It's a concept from automata theory which is a concept from theory of computation. Implementations of DFA's are how libraries like google's re2 or golang's regex are implemented. They&#x27
3. 3.▲
   by hexspeaker 9y ago

   If this interests you, you'll probably enjoy reading Google's paper on Spanner. Cockroachdb was heavily influenced by it. https://research.google.com/archive/spanner.html