Template:Strings

Safer nicotine wiki Tobacco Harm Reduction
Revision as of 18:12, 4 February 2020 by Wikipedia>Jochen Burghardt (a regular grammar describes a set of strings; regular tree grammars are a generalization that describe sets of trees; what about Deterministic finite automaton, regular language. alternating finite automaton, prefix grammar?)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search