Template:Strings

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jochen Burghardt (talk | contribs) at 17:12, 4 February 2020 (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?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.