| Marcus Contextual Grammars 1997 Edition Contributor(s): Paun, Gheorghe (Author) |
|
 |
ISBN: 0792347838 ISBN-13: 9780792347835 Publisher: Springer OUR PRICE: $161.49 Product Type: Hardcover - Other Formats Published: October 1997 Annotation: Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts interplay (selection). Most of the theoretical results obtained so far about the many variants of contextual grammars are presented with emphasis on classes of questions with relevance for applications in the study of natural language syntax: generative powers, descriptive and computational complexity, automata recognition, semilinearity, structure of the generated strings, ambiguity, regulated rewriting, etc. Constant comparison with families of languages in the Chomsky hierarchy is made. Connections with non-linguistic areas are established, such as molecular computing. Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax. |
| Additional Information |
| BISAC Categories: - Science - Mathematics | Logic - Language Arts & Disciplines | Linguistics - General |
| Dewey: 511.3 |
| LCCN: 97034636 |
| Series: Studies in Linguistics and Philosophy |
| Physical Information: 0.88" H x 6.14" W x 9.21" (1.61 lbs) 378 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts interplay (selection). Most of the theoretical results obtained so far about the many variants of contextual grammars are presented with emphasis on classes of questions with relevance for applications in the study of natural language syntax: generative powers, descriptive and computational complexity, automata recognition, semilinearity, structure of the generated strings, ambiguity, regulated rewriting, etc. Constant comparison with families of languages in the Chomsky hierarchy is made. Connections with non-linguistic areas are established, such as molecular computing. Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax. |