Grammatical Inference: Algorithms and Applications 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Oliveira, Arlindo L. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Έκδοση:1st ed. 2000.
Σειρά:Lecture Notes in Artificial Intelligence ; 1891
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04311nam a2200577 4500
001 978-3-540-45257-7
003 DE-He213
005 20191024052546.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 |a 9783540452577  |9 978-3-540-45257-7 
024 7 |a 10.1007/b75249  |2 doi 
040 |d GrThAP 
050 4 |a QA76.7-76.73 
050 4 |a QA76.76.C65 
072 7 |a UMX  |2 bicssc 
072 7 |a COM051010  |2 bisacsh 
072 7 |a UMX  |2 thema 
072 7 |a UMC  |2 thema 
082 0 4 |a 005.13  |2 23 
245 1 0 |a Grammatical Inference: Algorithms and Applications  |h [electronic resource] :  |b 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings /  |c edited by Arlindo L. Oliveira. 
250 |a 1st ed. 2000. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2000. 
300 |a VIII, 316 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Artificial Intelligence ;  |v 1891 
505 0 |a 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 and Dictionaries. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Pattern recognition. 
650 0 |a Artificial intelligence. 
650 0 |a Mathematical logic. 
650 0 |a Algorithms. 
650 1 4 |a Programming Languages, Compilers, Interpreters.  |0 http://scigraph.springernature.com/things/product-market-codes/I14037 
650 2 4 |a Pattern Recognition.  |0 http://scigraph.springernature.com/things/product-market-codes/I2203X 
650 2 4 |a Artificial Intelligence.  |0 http://scigraph.springernature.com/things/product-market-codes/I21000 
650 2 4 |a Mathematical Logic and Formal Languages.  |0 http://scigraph.springernature.com/things/product-market-codes/I16048 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
700 1 |a Oliveira, Arlindo L.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662197219 
776 0 8 |i Printed edition:  |z 9783540410119 
830 0 |a Lecture Notes in Artificial Intelligence ;  |v 1891 
856 4 0 |u https://doi.org/10.1007/b75249  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)