Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
134
click to vote
ICGI
2010
Springer
132
views
Natural Language Processing
»
more
ICGI 2010
»
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
15 years 4 months ago
Download
www-erato.ist.hokudai.ac.jp
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka
claim paper
Read More »