Topics in Grammatical Inference
Editat de Jeffrey Heinz, José M. Sempereen Limba Engleză Hardback – 13 mai 2016
The topics chosen are of foundational interest withrelatively mature and established results, algorithms and conclusions. The bookwill be of value to researchers and graduate students in areas such astheoretical computer science, machine learning, computational linguistics, bioinformatics,and cognitive psychology who are engaged with the study of learning, especiallyof the structure underlying the concept to be learned. Some knowledge ofmathematics and theoretical computer science, including formal language theory,automata theory, formal grammars, and algorithmics, is a prerequisite forreading this book.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 644.15 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 27 mai 2018 | 644.15 lei 6-8 săpt. | |
Hardback (1) | 650.40 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 13 mai 2016 | 650.40 lei 6-8 săpt. |
Preț: 650.40 lei
Preț vechi: 813.00 lei
-20% Nou
Puncte Express: 976
Preț estimativ în valută:
124.47€ • 128.41$ • 105.34£
124.47€ • 128.41$ • 105.34£
Carte tipărită la comandă
Livrare economică 04-18 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662483930
ISBN-10: 3662483939
Pagini: 304
Ilustrații: XVII, 247 p. 56 illus., 7 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.55 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662483939
Pagini: 304
Ilustrații: XVII, 247 p. 56 illus., 7 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.55 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Textul de pe ultima copertă
This book explains advanced theoretical andapplication-related issues in grammatical inference, a research area inside theinductive inference paradigm for machine learning. The first three chapters ofthe book deal with issues regarding theoretical learning frameworks; the nextfour chapters focus on the main classes of formal languages according toChomsky's hierarchy, in particular regular and context-free languages; and thefinal chapter addresses the processing of biosequences.
The topics chosen are of foundational interest withrelatively mature and established results, algorithms and conclusions. The bookwill be of value to researchers and graduate students in areas such astheoretical computer science, machine learning, computational linguistics, bioinformatics,and cognitive psychology who are engaged with the study of learning, especiallyof the structure underlying the concept to be learned. Some knowledge ofmathematics and theoretical computer science, including formal language theory,automata theory, formal grammars, and algorithmics, is a prerequisite forreading this book.
The topics chosen are of foundational interest withrelatively mature and established results, algorithms and conclusions. The bookwill be of value to researchers and graduate students in areas such astheoretical computer science, machine learning, computational linguistics, bioinformatics,and cognitive psychology who are engaged with the study of learning, especiallyof the structure underlying the concept to be learned. Some knowledge ofmathematics and theoretical computer science, including formal language theory,automata theory, formal grammars, and algorithmics, is a prerequisite forreading this book.
Caracteristici
Contributing authors among leading researchers in this Valuable for researchers and graduate students in theoretical computer science, computational linguistics, bioinformatics, and cognitive psychology Topics of foundational interest with mature and established results, algorithmsand conclusions Includes supplementary material: sn.pub/extras