Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008994580/catalog> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- catalog contributor b12641522.
- catalog contributor b12641523.
- catalog contributor b12641524.
- catalog contributor b12641525.
- catalog created "2002.".
- catalog date "2002".
- catalog date "2002.".
- catalog dateCopyrighted "2002.".
- catalog description "Includes bibliographical references and index.".
- catalog description "Inference of Sequential Association Rules Guided by Context-Free Grammars / C.M. Antunes and A.L. Oliveira -- PCFG Learning by Nonterminal Partition Search / A. Belz -- Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations / A. Cano, J. Ruiz and P. Garcia -- Beyond EDSM / O. Cicchello and S.C. Kremer -- Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard / C. Costa Florencio -- Some Classes of Regular Languages Identifiable in the Limit from Positive Data / F. Denis, A. Lemay and A. Terlutte -- Learning Probabilistic Residual Finite State Automata / Y. Esposito, A. Lemay, F. Denis and P. Dupont -- Fragmentation: Enhancing Identifiability / H. Fernau.".
- catalog extent "ix, 314 p. :".
- catalog identifier "3540442391 (softcover : alk. paper)".
- catalog isPartOf "Lecture notes in computer science ; 2484. Lecture notes in artificial intelligence".
- catalog isPartOf "Lecture notes in computer science ; 2484.".
- catalog isPartOf "Lecture notes in computer science. Lecture notes in artificial intelligence.".
- catalog issued "2002".
- catalog issued "2002.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "005.13/1 21".
- catalog subject "Formal languages Congresses.".
- catalog subject "Logic, Symbolic and mathematical Congresses.".
- catalog subject "QA267.3 .I55 2002a".
- catalog tableOfContents "Inference of Sequential Association Rules Guided by Context-Free Grammars / C.M. Antunes and A.L. Oliveira -- PCFG Learning by Nonterminal Partition Search / A. Belz -- Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations / A. Cano, J. Ruiz and P. Garcia -- Beyond EDSM / O. Cicchello and S.C. Kremer -- Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard / C. Costa Florencio -- Some Classes of Regular Languages Identifiable in the Limit from Positive Data / F. Denis, A. Lemay and A. Terlutte -- Learning Probabilistic Residual Finite State Automata / Y. Esposito, A. Lemay, F. Denis and P. Dupont -- Fragmentation: Enhancing Identifiability / H. Fernau.".
- catalog title "Grammatical inference : algorithms and applications : 6th international colloquium, ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002 : proceedings / Pieter Adriaans, Henning Fernau, Menno van Zaanen (eds.).".
- catalog type "Amsterdam (2002) swd".
- catalog type "Conference proceedings. fast".
- catalog type "text".