Template:Strings: Difference between revisions
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? |
Richardpruen (talk | contribs) m 1 revision imported |
(No difference)
|