Viewing profile — hexspeaker

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 i…

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 g…

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