Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	März 2012
Genre:	EDV / Informatik
	Algorithms / Automata / formallanguage / Grammars / Natural / Turing
ISBN:	9781461395973
EAN-Code:	9781461395973
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 12 mm
Gewicht:	335 gr
Seiten:	216
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This voume combines An Introduction to Formal Language Theory with issues in computational linguistics. The book begins with standard formal language material, including a discussion of regular, context-free, context sensitive, and arbitrary phrase stucture languages. This is followed by a discussion of the corresponding families of automata: finite-state, push-down, linear bounded and Turing machines. Important topics introduced along the way include closure properties, normal forms, nondeterminism, basic parsing algorithms, and the theory of computability and undecidability. Special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages. Advanced topics in parsing are also emphasized in an unusually clear and precise presentation. A unique feature of the book is the two chapter introduction to the formal theory of natural languages. Alternative schemes for representing natural language are discussed, in particular ATNs and GPSG. This book is part of the AKM Series in Theoretical Computer Science. "A Basis for Theoretical Computer Science", also in the series, should provide the necessary background for this volume intended to serve as a text for upper undergraduate and graduate level students.