My Account Log in

1 option

Topics in Grammatical Inference / edited by Jeffrey Heinz, José M. Sempere.

EBSCOhost Academic eBook Collection (North America) Available online

View online
Format:
Book
Contributor:
Heinz, Jeffrey., Editor.
Sempere, José M., Editor.
Language:
English
Subjects (All):
Computers.
Artificial intelligence.
Computational linguistics.
Bioinformatics.
Theory of Computation.
Artificial Intelligence.
Computational Linguistics.
Computational Biology/Bioinformatics.
Local Subjects:
Theory of Computation.
Artificial Intelligence.
Computational Linguistics.
Computational Biology/Bioinformatics.
Physical Description:
1 online resource (258 p.)
Edition:
1st ed. 2016.
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
Summary:
This book explains advanced theoretical and application-related issues in grammatical inference, a research area inside the inductive inference paradigm for machine learning. The first three chapters of the book deal with issues regarding theoretical learning frameworks; the next four chapters focus on the main classes of formal languages according to Chomsky's hierarchy, in particular regular and context-free languages; and the final chapter addresses the processing of biosequences. The topics chosen are of foundational interest with relatively mature and established results, algorithms and conclusions. The book will be of value to researchers and graduate students in areas such as theoretical computer science, machine learning, computational linguistics, bioinformatics, and cognitive psychology who are engaged with the study of learning, especially of the structure underlying the concept to be learned. Some knowledge of mathematics and theoretical computer science, including formal language theory, automata theory, formal grammars, and algorithmics, is a prerequisite for reading this book.
Contents:
Introduction
Gold-Style Learning Theory
Efficiency in the Identification in the Limit Learning Paradigm
Learning Grammars and Automata with Queries
On the Inference of Finite State Automata from Positive and Negative Data
Learning Probability Distributions Generated by Finite-State Machines
Distributional Learning of Context-Free and Multiple
Context-Free Grammars
Learning Tree Languages
Learning the Language of Biological Sequences.
Notes:
Description based upon print version of record.
Includes bibliographical references.
ISBN:
3-662-48395-5

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