Difference between revisions of "Grammar, formal"
From Encyclopedia of Mathematics
(Importing text file) |
m (→References: zbl link) |
||
| Line 7: | Line 7: | ||
====References==== | ====References==== | ||
| − | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> | + | <table> |
| + | <TR><TD valign="top">[a1]</TD> <TD valign="top"> J.E. Hopcroft, J.D. Ulman, "Introduction to automata theory, languages and computation", Addison-Wesley (1979) {{ZBL|0426.68001}}</TD></TR> | ||
| + | </table> | ||
Latest revision as of 20:29, 16 December 2023
A name given to certain types of calculi (cf. Calculus) used in mathematical linguistics to describe the structure of natural (and some artificial, particularly programming) languages. See Grammar, generative; Grammar, dominating; Grammar, categorial; Grammar, transformational.
Comments
Cf. also Formal languages and automata.
References
| [a1] | J.E. Hopcroft, J.D. Ulman, "Introduction to automata theory, languages and computation", Addison-Wesley (1979) Zbl 0426.68001 |
How to Cite This Entry:
Grammar, formal. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Grammar,_formal&oldid=16820
Grammar, formal. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Grammar,_formal&oldid=16820
This article was adapted from an original article by A.V. Gladkii (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article