0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Regulated Rewriting in Formal Language Theory (Paperback, Softcover reprint of the original 1st ed. 1989) Loot Price: R2,975
Discovery Miles 29 750
Regulated Rewriting in Formal Language Theory (Paperback, Softcover reprint of the original 1st ed. 1989): Jurgen Dassow,...

Regulated Rewriting in Formal Language Theory (Paperback, Softcover reprint of the original 1st ed. 1989)

Jurgen Dassow, Gheorghe Paun

Series: Monographs in Theoretical Computer Science. An EATCS Series, 18

 (sign in to rate)
Loot Price R2,975 Discovery Miles 29 750 | Repayment Terms: R279 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

To our families The formal language theory was born in the middle of our century as a tool for modelling and investigating the syntax of natural languages, and it has been developed mainly in connection with programming language handling. Of course, one cannot deny the impulses from neuronal net investigations, from logic, as well as the mathematical motivation of the early researches. The theory has rapidly become a mature one, with specific problems, techniques and results and with an internal self-motivated life. Abstract enough to deal with the essence of modelled phenomena, formal language theory has been applied during the last years to many further non-linguistical fields, sometimes surprisingly far from the previous areas of applications; such fields are developmental biology, economic modelling, semiotics of folklore, dramatic and musical works, cryptography, sociology, psychology, and so on. All these applications as well as the traditional ones to natural and programming languages revealed a rather common conclusion: very frequently, context-free gram mars, the most developed and the most "tractable" type of Chomsky grammars, are not sufficient. "The world is non-context-free" (and we shall "prove" this statement in Section 0.4). On the other hand, the context-sensitive grammars are too powerful and definitely "intractable" (many problems are undecidable or are still open; there is no semantic interpretation of the nonterminals an so on). This is the reason to look for intermediate generative devices, conjoining the simpli city and the beauty of context-free grammars with the power of context-sensitive ones.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Monographs in Theoretical Computer Science. An EATCS Series, 18
Release date: December 2011
First published: 1989
Authors: Jurgen Dassow • Gheorghe Paun
Dimensions: 242 x 170 x 17mm (L x W x T)
Format: Paperback
Pages: 308
Edition: Softcover reprint of the original 1st ed. 1989
ISBN-13: 978-3-642-74934-6
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > Applications of computing > General
LSN: 3-642-74934-8
Barcode: 9783642749346

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners