Unrestricted Grammar
978-613-6-29275-5
6136292750
84
2011-06-28
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786136292755.jpg
https://images.our-assets.com/fullcover/230x230/9786136292755.jpg
https://images.our-assets.com/cover/2000x/9786136292755.jpg
https://images.our-assets.com/fullcover/2000x/9786136292755.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In formal language theory, an unrestricted grammar is a formal grammar on which no restrictions are made on the left and right sides of the grammar's productions. This is the most general class of grammars in the Chomsky–Schützenberger hierarchy, and can generate arbitrary recursively enumerable languages.An unrestricted grammar is a formal grammar G = (N,Σ,P,S), where N is a set of nonterminal symbols, Σ is a set of terminal symbols, N and Σ are disjoint (actually, this is not strictly necessary, because unrestricted grammars make no real distinction between nonterminal and terminal symbols, the designation exists purely so that one knows when to stop when trying to generate sentential forms of the grammar), P is a set of production rules of the form alpha to beta where α and β are strings of symbols in N cup Sigma and α is not the empty string, and S in N is a specially designated start symbol. As the name implies, there are no real restrictions on the types of production rules that unrestricted grammars can have.
https://www.morebooks.de/books/gb/published_by/betascript-publishing/1/products
General and comparative linguistics
https://www.morebooks.de/store/gb/book/unrestricted-grammar/isbn/978-613-6-29275-5