04842nam 22007095 450 991014362210332120200701074803.03-540-45257-510.1007/b75249(CKB)1000000000211298(SSID)ssj0000323581(PQKBManifestationID)11247951(PQKBTitleCode)TC0000323581(PQKBWorkID)10318924(PQKB)10742092(DE-He213)978-3-540-45257-7(MiAaPQ)EBC3088791(PPN)15517438X(EXLCZ)99100000000021129820121227d2000 u| 0engurnn|008mamaatxtccrGrammatical Inference: Algorithms and Applications 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings /edited by Arlindo L. Oliveira1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (VIII, 316 p.) Lecture Notes in Artificial Intelligence ;1891Bibliographic Level Mode of Issuance: Monograph3-540-41011-2 Includes bibliographical references at the end of each chapters and index.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.Lecture Notes in Artificial Intelligence ;1891Programming languages (Electronic computers)Pattern recognitionArtificial intelligenceMathematical logicAlgorithmsProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Pattern Recognitionhttps://scigraph.springernature.com/ontologies/product-market-codes/I2203XArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Programming languages (Electronic computers).Pattern recognition.Artificial intelligence.Mathematical logic.Algorithms.Programming Languages, Compilers, Interpreters.Pattern Recognition.Artificial Intelligence.Mathematical Logic and Formal Languages.Algorithm Analysis and Problem Complexity.005.13/1Oliveira Arlindo Ledthttp://id.loc.gov/vocabulary/relators/edtInternational Colloquium on Grammatical InferenceBOOK9910143622103321Grammatical Inference: Algorithms and Applications772098UNINA