- 5 Ergebnisse
Kleinster Preis: € 59,49, größter Preis: € 89,00, Mittelwert: € 69,33
1
Grammatical Inference - 50-99.99
Bestellen
bei ebooks.com
€ 89,00
Bestellengesponserter Link
50-99.99:

Grammatical Inference - neues Buch

2000, ISBN: 9783540452577

The Fifth International Colloquium on Grammatical Inference (ICGI-2000) was heldinLisbononSeptember11–13th,2000.ICGI-2000wasthe?fthinaseriesof successfulbiennialinternationalconferencesin… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
2
Grammatical Inference: Algorithms and Applications - Arlindo L. Oliveira
Bestellen
bei Springer.com
€ 59,49
Bestellengesponserter Link

Arlindo L. Oliveira:

Grammatical Inference: Algorithms and Applications - neues Buch

ISBN: 9783540452577

Computer Science; Programming Languages, Compilers, Interpreters; Pattern Recognition; Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Algorithm Analysi… Mehr…

  - Versandkosten:zzgl. Versandkosten.
3
Grammatical Inference: Algorithms and Applications : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings - Berta Scharrer
Bestellen
bei hive.co.uk
£ 53,54
(ca. € 62,84)
Bestellengesponserter Link
Berta Scharrer:
Grammatical Inference: Algorithms and Applications : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings - neues Buch

2000

ISBN: 9783540452577

; PDF; Computing > Computer programming / software development > Programming & scripting languages: general, Springer Berlin Heidelberg

No. 9783540452577. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
4
Grammatical Inference: Algorithms and Applications : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings - Jiming Liu
Bestellen
bei hive.co.uk
£ 53,54
(ca. € 61,84)
Bestellengesponserter Link
Jiming Liu:
Grammatical Inference: Algorithms and Applications : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings - neues Buch

2000, ISBN: 9783540452577

; PDF; Computing > Computer programming / software development > Programming & scripting languages: general, Springer Berlin Heidelberg

No. 9783540452577. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
5
Bestellen
bei eBook.de
€ 73,49
Versand: € 0,001
Bestellengesponserter Link
Grammatical Inference: Algorithms and Applications - neues Buch

2000, ISBN: 9783540452577

Grammatical Inference: Algorithms and Applications ab 73.49 EURO 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings Medien > Bücher, [PU: Springe… Mehr…

  - Nr. Versandkosten:, , DE. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - Grammatical Inference: Algorithms and Applications


EAN (ISBN-13): 9783540452577
Erscheinungsjahr: 2000
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-05-10T02:05:25+02:00 (Vienna)
Detailseite zuletzt geändert am 2022-06-15T20:22:55+02:00 (Vienna)
ISBN/EAN: 9783540452577

ISBN - alternative Schreibweisen:
978-3-540-45257-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: scharrer
Titel des Buches: grammatical, colloquium international


Daten vom Verlag:

Autor/in: Arlindo L. Oliveira
Titel: Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence; Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings
Verlag: Springer; Springer Berlin
316 Seiten
Erscheinungsjahr: 2004-02-13
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
VIII, 316 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Automat; Natural; algorithms; automata; computational linguistics; learning; linguistics; machine learning; pattern recognition; algorithm analysis and problem complexity; C; Compilers and Interpreters; Automated Pattern Recognition; Artificial Intelligence; Formal Languages and Automata Theory; Algorithms; Computer Science; Mustererkennung; Künstliche Intelligenz; Theoretische Informatik; Algorithmen und Datenstrukturen; BC

Inference of Finite-State Transducers by Using Regular Grammars and Morphisms.- Computational Complexity of Problems on Probabilistic Grammars and Transducers.- Efficient Ambiguity Detection in C-NFA.- Learning Regular Languages Using Non Deterministic Finite Automata.- Smoothing Probabilistic Automata: An Error-Correcting Approach.- Inferring Subclasses of Contextual Languages.- Permutations and Control Sets for Learning Non-regular Language Families.- On the Complexity of Consistent Identification of Some Classes of Structure Languages.- Computation of Substring Probabilities in Stochastic Grammars.- A Comparative Study of Two Algorithms for Automata Identification.- The Induction of Temporal Grammatical Rules from Multivariate Time Series.- Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata.- Iterated Transductions and Efficient Learning from Positive Data: A Unifying View.- An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit.- Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm.- Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars.- On the Relationship between Models for Learning in Helpful Environments.- Probabilistic k-Testable Tree Languages.- Learning Context-Free Grammars from Partially Structured Examples.- Identification of Tree Translation Rules from Examples.- Counting Extensional Differences in BC-Learning.- Constructive Learning of Context-Free Languages with a Subpansive Tree.- A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample.- Improve the Learning of Subsequential Transducers by Using Alignments andDictionaries.
Includes supplementary material: sn.pub/extras

< zum Archiv...