My Account Log in

1 option

Modern Language Models and Computation : Theory with Applications / by Alexander Meduna, Ondřej Soukup.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Author/Creator:
Meduna, Alexander, 1957- author.
Soukup, Ondřej, 1951- author.
Contributor:
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Language:
English
Subjects (All):
Computers.
Computer science--Mathematics.
Computer science.
Computational linguistics.
Theory of Computation.
Mathematics of Computing.
Computational Linguistics.
Local Subjects:
Theory of Computation.
Mathematics of Computing.
Computational Linguistics.
Physical Description:
1 online resource (XIX, 548 pages) : 20 illustrations
Edition:
First edition 2017.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2017.
System Details:
text file PDF
Summary:
This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, distribution and cooperation covered in this book. As a result, it allows the user to develop, study, and improve these methods very effectively. This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, and computer science. Advanced-level students studying computer science, mathematics, linguistics and biology will find this textbook a valuable resource. Theoreticians, practitioners and researchers working in today's theory of computation and its applications will also find this book essential as a reference.
Contents:
Abstract
Acknowledgments
Preface
Mathematical Background
Classical Rewriting in Language Theory: Basics
Regulated Generation
Parallel Generation
Jumping Generation
Alternative Generation Based on Algebraic Restrictions
Regulated Acceptance
Jumping Acceptance
Acceptance with Deep Pushdowns
Alternative Acceptance Based on Algebraic Restrictions
Generation of Languages by Automata
Language Multigeneration by Grammar Systems
Applications and Their Perspectives in General
Applications in Linguistics
Applications in Biology
Concluding and Bibliographical Remarks
Bibliography
Index to Special Symbols
Index to Language Famiolies and Their Models
Subject Index.
Other Format:
Printed edition:
ISBN:
978-3-319-63100-4
9783319631004
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account